Combinatorial Optimization

Lagrangean Decomposition for Mean-Variance Combinatorial Optimization

Pages 62-74

Baumann, Frank (et al.)

Maximum Generalized Assignment with Convex Costs

Pages 75-86

Bender, Marco (et al.)

An Integer Programming Formulation for the Maximum k-Subset Intersection Problem

Pages 87-99

Bogue, Eduardo T. (et al.)

b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs

Pages 100-111

Bonomo, Flavia (et al.)

Proactive Reactive Scheduling in Resource Constrained Projects with Flexibility and Quality Robustness Requirements

Pages 112-124

Brčić, Mario (et al.)

Active Set Methods with Reoptimization for Convex Quadratic Integer Programming

Pages 125-136

Buchheim, Christoph (et al.)

Fixed-Parameter Algorithms for Scaffold Filling

Pages 137-148

Bulteau, Laurent (et al.)

Finding Totally Independent Spanning Trees with Linear Integer Programming

Pages 149-160

Cunha, Alexandre Salles (et al.)

Coupled-Tasks in Presence of Bipartite Compatibilities Graphs

Pages 161-172

Darties, Benoit (et al.)

The Computational Complexity of Stochastic Optimization

Pages 173-185

Campos, Cassio Polpo (et al.)

A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem

Pages 186-197

Della Croce, Federico (et al.)

A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection

Pages 198-207

Della Croce, Federico (et al.)

Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods

Pages 208-220

Disser, Yann (et al.)

Lovász and Schrijver $$N_+$$-Relaxation on Web Graphs

Pages 221-229

Escalante, Mariana (et al.)

The Envy-Free Pricing Problem and Unit-Demand Markets

Pages 230-241

Fernandes, Cristina G. (et al.)

Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree Protocol

Pages 242-254

Fortz, Bernard (et al.)

Graph Compact Orthogonal Layout Algorithm

Pages 255-266

Freivalds, Kārlis (et al.)

State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting

Pages 267-279

Furini, Fabio (et al.)

Decomposition Algorithm for the Single Machine Scheduling Polytope

Pages 280-291

Hoeksma, Ruben (et al.)

Subexponential Fixed-Parameter Algorithms for Partial Vector Domination

Pages 292-304

Ishii, Toshimasa (et al.)

Efficient Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval

Pages 305-314

Kacem, Imed (et al.)

A Multi-period Bi-level Stochastic Programming with Decision Dependent Uncertainty in Supply Chains

Pages 315-324

Kristianto, Yohanes

$$\{k\}$$-Packing Functions of Graphs

Pages 325-335

Leoni, Valeria Alejandra (et al.)

Robust Shift Scheduling in Call Centers

Pages 336-346

Mattia, Sara (et al.)

A Tabu Search Heuristic for the Equitable Coloring Problem

Pages 347-358

Méndez Díaz, Isabel (et al.)

Linear Arrangement Problems and Interval Graphs

Pages 359-370

Quilliot, Alain (et al.)

On the Asymmetric Connected Facility Location Polytope

Pages 371-383

Leitner, Markus (et al.)

Heuristic Approaches for the Robust Vehicle Routing Problem

Pages 384-395

Solano-Charris, Elyn L. (et al.)

A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack Problems

Pages 396-407

Hifi, Mhand (et al.)

Approximating the $$k$$-Set Packing Problem by Local Improvements

Pages 408-420

Fürer, Martin (et al.)

Multi-Objective Cuckoo Search with Leader Selection Strategies

Pages 421-432

Zeltni, Kamel (et al.)

Vulnerability Assessment of Spatial Networks: Models and Solutions

Pages 433-444

Álvarez-Miranda, Eduardo (et al.)