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.

2018, volume 36, articles 4

The capture time of a planar graph pp. 1103-1117

Photchchara Pisantechakool and Xuehou Tan

The w-centroids and least w-central subtrees in weighted trees pp. 1118-1127

Erfang Shan and Liying Kang

The mixed center location problem pp. 1128-1144

Yi Xu, Jigen Peng and Yinfeng Xu

Congestion games with mixed objectives pp. 1145-1167

Matthias Feldotto, Lennart Leder and Alexander Skopalik

Cost-efficient scheduling on machines from the cloud pp. 1168-1194

Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide and Sören Riechers

On residual approximation in solution extension problems pp. 1195-1220

Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König and Valentin Pollet

Safe sets in graphs: Graph classes and structural parameters pp. 1221-1242

Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Hirotaka Ono, Yota Otachi, Tadashi Sakuma, Zsolt Tuza and Renyu Xu

Constant factor approximation for the weighted partial degree bounded edge packing problem pp. 1243-1261

Pawan Aurora, Monalisa Jena and Rajiv Raman

A quadratic time exact algorithm for continuous connected 2-facility location problem in trees pp. 1262-1298

Wei Ding and Ke Qiu

The mixed evacuation problem pp. 1299-1314

Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh and Atsushi Takizawa

Finding disjoint paths on edge-colored graphs: more tractability results pp. 1315-1332

Riccardo Dondi and Florian Sikora

Broadcasting multiple messages in the 1-in port model in optimal time pp. 1333-1355

Petr Gregor, Riste Škrekovski and Vida Vukašinović

Scheduling with interjob communication on parallel processors pp. 1356-1379

Jürgen König, Alexander Mäcker, Friedhelm Meyer auf der Heide and Sören Riechers

Equivalence of two-sided stable matching pp. 1380-1387

Liwei Zhong and Yanqin Bai

Embeddings into almost self-centered graphs of given radius pp. 1388-1410

Kexiang Xu, Haiqiong Liu, Kinkar Ch. Das and Sandi Klavžar

List 2-distance $$\varDelta +3$$ Δ + 3 -coloring of planar graphs without 4,5-cycles pp. 1411-1424

Haiyang Zhu, Yu Gu, Jingjun Sheng and Xinzhong Lü

New bounds for locally irregular chromatic index of bipartite and subcubic graphs pp. 1425-1438

Borut Lužar, Jakub Przybyło and Roman Soták

2018, volume 36, articles 3

Base polyhedra and the linking property pp. 671-677

Tamás Király

On a general framework for network representability in discrete optimization pp. 678-708

Yuni Iwamasa

A compact representation for minimizers of k-submodular functions pp. 709-741

Hiroshi Hirai and Taihei Oki

An algorithm for finding a representation of a subtree distance pp. 742-762

Kazutoshi Ando and Koki Sato

Lot sizing with storage losses under demand uncertainty pp. 763-788

Stefano Coniglio, Arie M. C. A. Koster and Nils Spiekermann

ILP formulation of the degree-constrained minimum spanning hierarchy problem pp. 789-811

Massinissa Merabet, Miklos Molnar and Sylvain Durand

Uniqueness of equilibria in atomic splittable polymatroid congestion games pp. 812-830

Tobias Harks and Veerle Timmermans

Sum-of-squares rank upper bounds for matching problems pp. 831-844

Adam Kurpisz, Samuli Leppänen and Monaldo Mastrolilli

Robust trading mechanisms over 0/1 polytopes pp. 845-860

Mustafa Ç. Pınar

Optimization problems with color-induced budget constraints pp. 861-870

Corinna Gottschalk, Hendrik Lüthen, Britta Peis and Andreas Wierz

Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays pp. 871-895

Sven Mallach

Planning personnel retraining: column generation heuristics pp. 896-915

Oliver G. Czibula, Hanyu Gu and Yakov Zinder

An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment pp. 916-936

Diego Recalde, Daniel Severín, Ramiro Torres and Polo Vaca

Subset sum problems with digraph constraints pp. 937-964

Laurent Gourvès, Jérôme Monnot and Lydia Tlilane

The QAP-polytope and the graph isomorphism problem pp. 965-1006

Pawan Aurora and Shashank K. Mehta

The weakly connected independent set polytope in corona and join of graphs pp. 1007-1023

F. Bendali and J. Mailfert

The min-up/min-down unit commitment polytope pp. 1024-1058

Pascale Bendotti, Pierre Fouilhoux and Cécile Rottner

Approximability and exact resolution of the multidimensional binary vector assignment problem pp. 1059-1073

Marin Bougeret, Guillerme Duvillié and Rodolphe Giroudeau

On the m-clique free interval subgraphs polytope: polyhedral analysis and applications pp. 1074-1101

Mohammed-Albarra Hassan, Imed Kacem, Sébastien Martin and Izzeldin M. Osman

2018, volume 36, articles 2

On approximating optimal weight “no”-certificates in weighted difference constraint systems pp. 329-345

Bugra Caskurlu, Matthew Williamson, K. Subramani and Vahan Mkrtchyan

Planar graphs without 4-cycles and close triangles are (2, 0, 0)-colorable pp. 346-364

Heather Hoskins, Runrun Liu, Jennifer Vandenbussche and Gexin Yu

Computing the k-resilience of a synchronized multi-robot system pp. 365-391

Sergey Bereg, Luis-Evaristo Caraballo, José-Miguel Díaz-Báñez and Mario A. Lopez

Blocking Rumor by Cut pp. 392-399

Ling Gai, Hongwei Du, Lidong Wu, Junlei Zhu and Yuehua Bu

A tractable discrete fractional programming: application to constrained assortment optimization pp. 400-415

Tian Xie and Dongdong Ge

Perfect graphs involving semitotal and semipaired domination pp. 416-433

Teresa W. Haynes and Michael A. Henning

Minimizing the total cost of barrier coverage in a linear domain pp. 434-457

Xiao Zhang, Haosheng Fan, Victor C. S. Lee, Minming Li, Yingchao Zhao and Chuang Liu

The $$(k,\ell )$$ ( k, ℓ ) -proper index of graphs pp. 458-471

Hong Chang, Xueliang Li, Colton Magnant and Zhongmei Qin

Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan pp. 472-492

Xing Chai and Wenhua Li

Online leasing problem with price fluctuations under the consumer price index pp. 493-507

Xin Feng, Yinfeng Xu, Guanqun Ni and Yongwu Dai

Min-Sum Bin Packing pp. 508-531

Leah Epstein, David S. Johnson and Asaf Levin

On the complete width and edge clique cover problems pp. 532-548

Le Van Bang and Sheng-Lung Peng

Approximation strategy-proof mechanisms for obnoxious facility location on a line pp. 549-571

Lili Mei, Deshi Ye and Yong Zhang

Algorithmic aspects of b-disjunctive domination in graphs pp. 572-590

B. S. Panda, Arti Pandey and Satya Paul

On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions pp. 591-616

Marc Hellmuth and Nicolas Wieseke

Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead pp. 617-636

Jiayin Pan, Yinfeng Xu and Guiqing Zhang

On the most imbalanced orientation of a graph pp. 637-669

Walid Ben-Ameur, Antoine Glorieux and José Neto

2018, volume 36, articles 1

The game chromatic index of some trees with maximum degree four and adjacent degree-four vertices pp. 1-12

Wai Lam Fong, Wai Hong Chan and Ge Nong

Minimum choosability of planar graphs pp. 13-22

Huijuan Wang, Bin Liu, Ling Gai, Hongwei Du and Jianliang Wu

Neighbor sum distinguishing total coloring of graphs with bounded treewidth pp. 23-34

Miaomiao Han, You Lu, Rong Luo and Zhengke Miao

A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network pp. 35-43

Lina Chen, Xiaohui Huang and Zhao Zhang

An improved online evacuation strategy from a convex region on grid networks pp. 44-54

Guiqing Zhang, Yongxi Cheng and Lan Qin

Minimum 2-distance coloring of planar graphs and channel assignment pp. 55-64

Junlei Zhu and Yuehua Bu

Relation between the skew-rank of an oriented graph and the independence number of its underlying graph pp. 65-80

Jing Huang, Shuchao Li and Hua Wang

An upper bound on the double Roman domination number pp. 81-89

J. Amjadi, S. Nazari-Moghaddam, S. M. Sheikholeslami and L. Volkmann

Optimum turn-restricted paths, nested compatibility, and optimum convex polygons pp. 90-107

Maurice Queyranne and Laurence A. Wolsey

2-Distance vertex-distinguishing index of subcubic graphs pp. 108-120

Victor Loumngam Kamga, Weifan Wang, Ying Wang and Min Chen

Majorization and the spectral radius of starlike trees pp. 121-129

Mohammad Reza Oboudi

Correction to: Majorization and the spectral radius of starlike trees pp. 130-130

Mohammad Reza Oboudi

Approximation algorithms for the bus evacuation problem pp. 131-141

Lehilton L. C. Pedrosa and Rafael C. S. Schouery

Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan pp. 142-161

Jinwei Gu, Manzhan Gu, Xiwen Lu and Ying Zhang

A two-phase optimization method for a multiobjective vehicle relocation problem in electric carsharing systems pp. 162-193

Maurizio Bruglieri, Ferdinando Pezzella and Ornella Pisacane

New lower bounds for the second variable Zagreb index pp. 194-210

Álvaro Martínez-Pérez and José M. Rodríguez

Path cooperative games pp. 211-229

Qizhi Fang, Bo Li, Xiaohan Shan and Xiaoming Sun

Distributed algorithms for barrier coverage via sensor rotation in wireless sensor networks pp. 230-251

Yueshi Wu and Mihaela Cardei

Algorithms for connected p-centdian problem on block graphs pp. 252-263

Liying Kang, Jianjie Zhou and Erfang Shan

An approximation algorithm for k-facility location problem with linear penalties using local search scheme pp. 264-279

Yishui Wang, Dachuan Xu, Donglei Du and Chenchen Wu

Improved algorithms for the evacuation route planning problem pp. 280-306

Gopinath Mishra, Subhra Mazumdar and Arindam Pal

Creating an acceptable consensus ranking for group decision making pp. 307-328

Kelin Luo, Yinfeng Xu, Bowen Zhang and Huili Zhang