Combinatorial Optimization: Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers

Front Matter....Pages I-XIX
Maximum Throughput Network Routing Subject to Fair Flow Allocation....Pages 1-12
Study of Identifying Code Polyhedra for Some Families of Split Graphs....Pages 13-25
Parametric Multiroute Flow and Its Application to Robust Network with $$k$$ Edge Failures....Pages 26-37
The Dominating Set Polytope via Facility Location....Pages 38-49
Solving Graph Partitioning Problems Arising in Tagless Cache Management....Pages 50-61
Lagrangean Decomposition for Mean-Variance Combinatorial Optimization....Pages 62-74
Maximum Generalized Assignment with Convex Costs....Pages 75-86
An Integer Programming Formulation for the Maximum k-Subset Intersection Problem....Pages 87-99
b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs....Pages 100-111
Proactive Reactive Scheduling in Resource Constrained Projects with Flexibility and Quality Robustness Requirements....Pages 112-124
Active Set Methods with Reoptimization for Convex Quadratic Integer Programming....Pages 125-136
Fixed-Parameter Algorithms for Scaffold Filling....Pages 137-148
Finding Totally Independent Spanning Trees with Linear Integer Programming....Pages 149-160
Coupled-Tasks in Presence of Bipartite Compatibilities Graphs....Pages 161-172
The Computational Complexity of Stochastic Optimization....Pages 173-185
A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem....Pages 186-197
A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection....Pages 198-207
Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods....Pages 208-220
Lovász and Schrijver $$N_+$$ -Relaxation on Web Graphs....Pages 221-229
The Envy-Free Pricing Problem and Unit-Demand Markets....Pages 230-241
Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree Protocol....Pages 242-254
Graph Compact Orthogonal Layout Algorithm....Pages 255-266
State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting....Pages 267-279
Decomposition Algorithm for the Single Machine Scheduling Polytope....Pages 280-291
Subexponential Fixed-Parameter Algorithms for Partial Vector Domination....Pages 292-304
Efficient Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval....Pages 305-314
A Multi-period Bi-level Stochastic Programming with Decision Dependent Uncertainty in Supply Chains....Pages 315-324
 $$\{k\}$$ -Packing Functions of Graphs....Pages 325-335
Robust Shift Scheduling in Call Centers....Pages 336-346
A Tabu Search Heuristic for the Equitable Coloring Problem....Pages 347-358
Linear Arrangement Problems and Interval Graphs....Pages 359-370
On the Asymmetric Connected Facility Location Polytope....Pages 371-383
Heuristic Approaches for the Robust Vehicle Routing Problem....Pages 384-395
A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack Problems....Pages 396-407
Approximating the $$k$$ -Set Packing Problem by Local Improvements....Pages 408-420
Multi-Objective Cuckoo Search with Leader Selection Strategies....Pages 421-432
Vulnerability Assessment of Spatial Networks: Models and Solutions....Pages 433-444
Back Matter....Pages 445-446