Journal of Combinatorial Optimization

1997 - 2025

Current editor(s): Thai, My T.

From Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Robot Map Verification of a Graph World pp. 383-395: Xiaotie Deng, Evangelos Milios and Andranik Mirzaian
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts pp. 397-410: Liang Zhao, Hiroshi Nagamochi and Toshihide Ibaraki
The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set pp. 411-420: H.Y. Lau and H.F. Ting
Quadratic Assignment Problems and M/G/C/C/ State Dependent Network Flows pp. 421-443: J. Macgregor Smith and Wu-Ji Li
Tight Performance Bounds of CP-Scheduling on Out-Trees pp. 445-464: Nodari Vakhania
Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems pp. 465-494: Mhand Hifi and Catherine Roucairol
Multichannel Optical Networks: Theory and Practice pp. 495-496: Mauricio G. C. Resende
Mobile Networks and Computing pp. 497-498: Mauricio G. C. Resende

Minimum Cost Edge Subset Covering Exactly k Vertices of a Graph pp. 275-286: Jáan Plesník
On Approximating a Scheduling Problem pp. 287-297: Pierluigi Crescenzi, Xiaotie Deng and Christos H. Papadimitriou
On Disjunctive Cuts for Combinatorial Optimization pp. 299-315: Adam N. Letchford
A $${{10}}$$ -Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem pp. 317-326: Robert Carr, Toshihiro Fujito, Goran Konjevod and Ojas Parekh
A Polynomial Time Approximation Scheme for the Problem of Interconnecting Highways pp. 327-343: Xiuzhen Cheng, Joon-Mo Kim and Bing Lu
Combinatorial Optimization in Real-Time Scheduling: Theory and Algorithms pp. 345-375: Shyh-In Hwang and Sheng-Tzong Cheng

Restarting after Branching in the SDP Approach to MAX-CUT and Similar Combinatorial Optimization Problems pp. 151-166: John E. Mitchell
Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability pp. 167-173: Daya Ram Gaur and Ramesh Krishnamurti
Augmenting a Submodular and Posi-modular Set Function by a Multigraph pp. 175-212: Hiroshi Nagamochi, Takashi Shiraki and Toshihide Ibaraki
A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree pp. 213-231: Tetsuo Asano, Naoki Katoh and Kazuhiro Kawashima
Approximation Algorithms for Bounded Facility Location Problems pp. 233-247: Piotr Krysta and Roberto Solis-Oba
Finding a Noncrossing Steiner Forest in Plane Graphs Under a 2-Face Condition pp. 249-266: Yoshiyuki Kusakari, Daisuke Masubuchi and Takao Nishizeki

Optimization Problems in Medical Applications pp. 7-8: Jie Wang
Quadratic Binary Programming and Dynamical System Approach to Determine the Predictability of Epileptic Seizures pp. 9-26: L.D. Iasemidis, P. Pardalos, J.C. Sackellares and D.-S. Shiau
Skeletonization of Volumetric Vascular Images—Distance Information Utilized for Visualization pp. 27-41: Ingela Nyström and Örjan Smedby
On the Addition and Comparison of Graphs Labeled with Stochastic Variables: Learnable Anatomical Catalogs pp. 43-58: Peter Hall
Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions pp. 59-79: Danny Z. Chen, Ovidiu Daescu, Xiaobo (Sharon) Hu, Xiaodong Wu and Jinhui Xu
Medical Surveillance, Frequent Sets, and Closure Operations pp. 81-94: Alan P. Sprague and Stephen E. Brossette
A Heuristic Algorithm for Multiple Sequence Alignment Based on Blocks pp. 95-115: Peng Zhao and Tao Jiang
Efficient Algorithms for Local Alignment Search pp. 117-124: S. Rajasekaran, H. Nick, P.M. Pardalos, S. Sahni and G. Shaw
Efficient Algorithms for Similarity Search pp. 125-132: S. Rajasekaran, Y. Hu, J. Luo, H. Nick, P.M. Pardalos, S. Sahni and G. Shaw
Tagged Probe Interval Graphs pp. 133-142: Li Sheng, Chi Wang and Peisen Zhang

Some Results on Node Lifting of TSP Inequalities pp. 395-414: Robert Carr
Generalized Steiner Problems and Other Variants pp. 415-436: Moshe Dror and Mohamed Haouari
On Some Polyhedra Covering Problems pp. 437-447: Cao An Wang, Bo-Ting Yang and Binhai Zhu
Incrementing Bipartite Digraph Edge-Connectivity pp. 449-486: Harold N. Gabow and Tibor Jordán
Medial Axis and Optimal Locations for Min-Max Sphere Packing pp. 487-503: Jie Wang

Graph Algorithms with Small Communication Costs pp. 291-305: Jieliang Zhou, Patrick Dymond and Xiaotie Deng
Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling pp. 307-323: Piotr Berman and Bhaskar Dasgupta
A Probabilistic Feasibility and Value Analysis of the Generalized Assignment Problem pp. 325-355: H. Edwin Romeijn and Nanda Piersma
Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem pp. 357-363: Bing Lu and Lu Ruan
Facets of an Assignment Problem with 0–1 Side Constraint pp. 365-388: Abdo Y. Alfakih, Tongnyoul Yi and Katta G. Murty

A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs pp. 151-169: Hiroshi Nagamochi, Shigeki Katayama and Toshihide Ibaraki
Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions pp. 171-186: M. Dawande, J. Kalagnanam, P. Keskinocak, F.S. Salman and R. Ravi
On the Complexity of the Steiner Problem pp. 187-195: M. Brazil, D.A. Thomas and J.F. Weng
A Semidefinite Programming Approach to the Quadratic Knapsack Problem pp. 197-215: C. Helmberg, F. Rendl and R. Weismantel
An Efficient Algorithm for Delay Buffer Minimization pp. 217-233: Guoliang Xue, Shangzhi Sun, David H.C. Du and Lojun Shi
On Integrality, Stability and Composition of Dicycle Packings and Covers pp. 235-251: Zeev Nutov and Michal Penn
Combining Linear and Non-Linear Objectives in Spanning Tree Problems pp. 253-269: Mauro Dell'Amico and Francesco Maffioli
A 75° Angle Constraint for Plane Minimal T1 Trees pp. 271-284: T. Cole

Editorial pp. 5-5: Ding-Zhu Du
Facility Dispersion Problems Under Capacity and Cost Constraints pp. 7-33: Daniel J. Rosenkrantz, Giri K. Tayi and S.S. Ravi
Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph pp. 35-77: Toshimasa Ishii, Hiroshi Nagamochi and Toshihide Ibaraki
Efficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems pp. 79-98: Y.Y. Li, K.S. Leung and C.K. Wong
On Shortest k-Edge-Connected Steiner Networks in Metric Spaces pp. 99-107: Xiufeng Du, Xiaodong Hu and Xiaohua Jia
Sequence Independent Lifting in Mixed Integer Programming pp. 109-129: Zonghao Gu, George L. Nemhauser and Martin W.P. Savelsbergh
Steiner k-Edge Connected Subgraph Polyhedra pp. 131-144: M. Didi Biha and A.R. Mahjoub