Abstract is missing.
- Maximum Throughput Network Routing Subject to Fair Flow AllocationEdoardo Amaldi, Stefano Coniglio, Leonardo Taccari. 1-12 [doi]
- Study of Identifying Code Polyhedra for Some Families of Split GraphsGabriela R. Argiroffo, Silvia M. Bianchi, Annegret Wagler. 13-25 [doi]
- Parametric Multiroute Flow and Its Application to Robust Network with k Edge FailuresJean-François Baffier, Vorapong Suppakitpaisarn, Hidefumi Hiraishi, Hiroshi Imai. 26-37 [doi]
- The Dominating Set Polytope via Facility LocationMourad Baïou, Francisco Barahona. 38-49 [doi]
- Solving Graph Partitioning Problems Arising in Tagless Cache ManagementSandro Bartolini, Iacopo Casini, Paolo Detti. 50-61 [doi]
- Lagrangean Decomposition for Mean-Variance Combinatorial OptimizationFrank Baumann, Christoph Buchheim, Anna Ilyina. 62-74 [doi]
- Maximum Generalized Assignment with Convex CostsMarco Bender, Stephan Westphal. 75-86 [doi]
- An Integer Programming Formulation for the Maximum k-Subset Intersection ProblemEduardo T. Bogue, Cid C. de Souza, Eduardo C. Xavier, Alexandre S. Freire. 87-99 [doi]
- b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-CographsFlavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon. 100-111 [doi]
- Proactive Reactive Scheduling in Resource Constrained Projects with Flexibility and Quality Robustness RequirementsMario Brcic, Damir Kalpic, Marija Katic. 112-124 [doi]
- Active Set Methods with Reoptimization for Convex Quadratic Integer ProgrammingChristoph Buchheim, Long Trieu. 125-136 [doi]
- Fixed-Parameter Algorithms for Scaffold FillingLaurent Bulteau, Anna Paola Carrieri, Riccardo Dondi. 137-148 [doi]
- Finding Totally Independent Spanning Trees with Linear Integer ProgrammingAlexandre Salles da Cunha, Fernanda Sumika Hojo de Souza. 149-160 [doi]
- Coupled-Tasks in Presence of Bipartite Compatibilities GraphsBenoît Darties, Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König. 161-172 [doi]
- The Computational Complexity of Stochastic OptimizationCassio Polpo de Campos, Georgios Stamoulis, Dennis Weyland. 173-185 [doi]
- A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion ProblemFederico Della Croce, Michele Garraffa, Fabio Salassa. 186-197 [doi]
- A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs SelectionFederico Della Croce, Christos Koulamas, Vincent T'Kindt. 198-207 [doi]
- Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with NeighborhoodsYann Disser, Matús Mihalák, Sandro Montanari, Peter Widmayer. 208-220 [doi]
- Lovász and Schrijver N_+ -Relaxation on Web GraphsMariana S. Escalante, Graciela L. Nasini. 221-229 [doi]
- The Envy-Free Pricing Problem and Unit-Demand MarketsCristina G. Fernandes, Carlos Eduardo Ferreira, Álvaro Junio Pereira Franco, Rafael C. S. Schouery. 230-241 [doi]
- Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree ProtocolBernard Fortz, Luís Gouveia, Martim Moniz. 242-254 [doi]
- Graph Compact Orthogonal Layout AlgorithmKarlis Freivalds, Jans Glagolevs. 255-266 [doi]
- State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position ShiftingFabio Furini, Martin Philip Kidd, Carlo Alfredo Persiani, Paolo Toth. 267-279 [doi]
- Decomposition Algorithm for the Single Machine Scheduling PolytopeRuben Hoeksma, Bodo Manthey, Marc Uetz. 280-291 [doi]
- Subexponential Fixed-Parameter Algorithms for Partial Vector DominationToshimasa Ishii, Hirotaka Ono, Yushi Uno. 292-304 [doi]
- Efficient Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability IntervalImed Kacem, Hans Kellerer, Maryam Seifaddini. 305-314 [doi]
- A Multi-period Bi-level Stochastic Programming with Decision Dependent Uncertainty in Supply ChainsYohanes Kristianto. 315-324 [doi]
- k -Packing Functions of GraphsValeria Alejandra Leoni, Erica G. Hinrichsen. 325-335 [doi]
- Robust Shift Scheduling in Call CentersSara Mattia, Fabrizio Rossi, Mara Servilio, Stefano Smriglio. 336-346 [doi]
- A Tabu Search Heuristic for the Equitable Coloring ProblemIsabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severin. 347-358 [doi]
- Linear Arrangement Problems and Interval GraphsAlain Quilliot, Djamal Rebaine. 359-370 [doi]
- On the Asymmetric Connected Facility Location PolytopeMarkus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl. 371-383 [doi]
- Heuristic Approaches for the Robust Vehicle Routing ProblemElyn L. Solano-Charris, Christian Prins, Andréa Cynthia Santos. 384-395 [doi]
- A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack ProblemsMhand Hifi, Sagvan Saleh, Lei Wu. 396-407 [doi]
- Approximating the k -Set Packing Problem by Local ImprovementsMartin Fürer, Huiwen Yu. 408-420 [doi]
- Multi-Objective Cuckoo Search with Leader Selection StrategiesKamel Zeltni, Souham Meshoul. 421-432 [doi]
- Vulnerability Assessment of Spatial Networks: Models and SolutionsEduardo Álvarez-Miranda, Alfredo Candia-Véjar, Emilio Carrizosa, Francisco Pérez-Galarce. 433-444 [doi]