Combinatorial Optimization: 4th International Symposium, ISCO 2016, Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected Papers

Front Matter....Pages I-XX
On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs....Pages 1-12
A Full Description of Polytopes Related to the Index of the Lowest Nonzero Row of an Assignment Matrix....Pages 13-25
On Robust Lot Sizing Problems with Storage Deterioration, with Applications to Heat and Power Cogeneration....Pages 26-37
Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions....Pages 38-49
The Parity Hamiltonian Cycle Problem in Directed Graphs....Pages 50-58
Lovász-Schrijver PSD-Operator on Claw-Free Graphs....Pages 59-70
Benders Decomposition for Capacitated Network Design....Pages 71-80
Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories....Pages 81-97
Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games....Pages 98-109
A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs....Pages 110-122
MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover....Pages 123-134
Towards an Accurate Solution of Wireless Network Design Problems....Pages 135-147
Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem....Pages 148-159
Exact Solution Methods for the k-Item Quadratic Knapsack Problem....Pages 160-165
On Vertices and Facets of Combinatorial 2-Level Polytopes....Pages 166-176
Optimization Problems with Color-Induced Budget Constraints....Pages 177-188
Strengthening Chvátal-Gomory Cuts for the Stable Set Problem....Pages 189-200
Scheduling Personnel Retraining: Column Generation Heuristics....Pages 201-212
Diagonally Dominant Programming in Distance Geometry....Pages 213-224
A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels....Pages 225-236
An Algorithm for Finding a Representation of a Subtree Distance....Pages 237-248
A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks....Pages 249-259
Shared Multicast Trees in Ad Hoc Wireless Networks....Pages 260-272
Two-Level Polytopes with a Prescribed Facet....Pages 273-284
Optimum Solution of the Closest String Problem via Rank Distance....Pages 285-296
Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut....Pages 297-307
The Multi-terminal Vertex Separator Problem: Polytope Characterization and TDI-ness....Pages 308-319
Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems....Pages 320-331
Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores....Pages 332-344
Balanced Partition of a Graph for Football Team Realignment in Ecuador....Pages 345-356
On a General Framework for Network Representability in Discrete Optimization....Pages 357-368
A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract)....Pages 369-380
Optimization Models for Multi-period Railway Rolling Stock Assignment....Pages 381-392
Sum-of-Squares Rank Upper Bounds for Matching Problems....Pages 393-402
A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases....Pages 403-413
The Maximum Matrix Contraction Problem....Pages 414-425
Integrated Production Scheduling and Delivery Routing: Complexity Results and Column Generation....Pages 426-438
Back Matter....Pages 439-450
....Pages 451-452