default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISCO 2014: Lisbon, Portugal
- Pierre Fouilhoux, Luis Eduardo Neves Gouveia, Ali Ridha Mahjoub, Vangelis Th. Paschos:
Combinatorial Optimization - Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8596, Springer 2014, ISBN 978-3-319-09173-0 - Edoardo Amaldi, Stefano Coniglio
, Leonardo Taccari:
Maximum Throughput Network Routing Subject to Fair Flow Allocation. 1-12 - Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Wagler:
Study of Identifying Code Polyhedra for Some Families of Split Graphs. 13-25 - Jean-François Baffier, Vorapong Suppakitpaisarn, Hidefumi Hiraishi, Hiroshi Imai:
Parametric Multiroute Flow and Its Application to Robust Network with k Edge Failures. 26-37 - Mourad Baïou, Francisco Barahona:
The Dominating Set Polytope via Facility Location. 38-49 - Sandro Bartolini, Iacopo Casini, Paolo Detti:
Solving Graph Partitioning Problems Arising in Tagless Cache Management. 50-61 - Frank Baumann, Christoph Buchheim, Anna Ilyina:
Lagrangean Decomposition for Mean-Variance Combinatorial Optimization. 62-74 - Marco Bender, Stephan Westphal:
Maximum Generalized Assignment with Convex Costs. 75-86 - Eduardo T. Bogue, Cid C. de Souza, Eduardo C. Xavier, Alexandre S. Freire:
An Integer Programming Formulation for the Maximum k-Subset Intersection Problem. 87-99 - Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon:
b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs. 100-111 - Mario Brcic, Damir Kalpic, Marija Katic:
Proactive Reactive Scheduling in Resource Constrained Projects with Flexibility and Quality Robustness Requirements. 112-124 - Christoph Buchheim, Long Trieu:
Active Set Methods with Reoptimization for Convex Quadratic Integer Programming. 125-136 - Laurent Bulteau, Anna Paola Carrieri, Riccardo Dondi:
Fixed-Parameter Algorithms for Scaffold Filling. 137-148 - Alexandre Salles da Cunha, Fernanda Sumika Hojo de Souza:
Finding Totally Independent Spanning Trees with Linear Integer Programming. 149-160 - Benoît Darties, Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König:
Coupled-Tasks in Presence of Bipartite Compatibilities Graphs. 161-172 - Cassio Polpo de Campos, Georgios Stamoulis, Dennis Weyland:
The Computational Complexity of Stochastic Optimization. 173-185 - Federico Della Croce, Michele Garraffa, Fabio Salassa:
A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem. 186-197 - Federico Della Croce, Christos Koulamas, Vincent T'kindt:
A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection. 198-207 - Yann Disser, Matús Mihalák, Sandro Montanari, Peter Widmayer:
Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods. 208-220 - Mariana S. Escalante, Graciela L. Nasini:
Lovász and Schrijver N_+ -Relaxation on Web Graphs. 221-229 - Cristina G. Fernandes, Carlos Eduardo Ferreira, Álvaro Junio Pereira Franco, Rafael Crivellari Saliba Schouery:
The Envy-Free Pricing Problem and Unit-Demand Markets. 230-241 - Bernard Fortz, Luis Eduardo Neves Gouveia, Martim Moniz:
Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree Protocol. 242-254 - Karlis Freivalds, Jans Glagolevs:
Graph Compact Orthogonal Layout Algorithm. 255-266 - Fabio Furini, Martin Philip Kidd, Carlo Alfredo Persiani, Paolo Toth:
State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting. 267-279 - Ruben Hoeksma, Bodo Manthey, Marc Uetz:
Decomposition Algorithm for the Single Machine Scheduling Polytope. 280-291 - Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Subexponential Fixed-Parameter Algorithms for Partial Vector Domination. 292-304 - Imed Kacem, Hans Kellerer, Maryam Seifaddini:
Efficient Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval. 305-314 - Yohanes Kristianto:
A Multi-period Bi-level Stochastic Programming with Decision Dependent Uncertainty in Supply Chains. 315-324 - Valeria Alejandra Leoni, Erica G. Hinrichsen:
k -Packing Functions of Graphs. 325-335 - Sara Mattia, Fabrizio Rossi, Mara Servilio, Stefano Smriglio:
Robust Shift Scheduling in Call Centers. 336-346 - Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
A Tabu Search Heuristic for the Equitable Coloring Problem. 347-358 - Alain Quilliot, Djamal Rebaine:
Linear Arrangement Problems and Interval Graphs. 359-370 - Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl:
On the Asymmetric Connected Facility Location Polytope. 371-383 - Elyn L. Solano-Charris, Christian Prins, Andréa Cynthia Santos:
Heuristic Approaches for the Robust Vehicle Routing Problem. 384-395 - Mhand Hifi, Sagvan Saleh, Lei Wu:
A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack Problems. 396-407 - Martin Fürer, Huiwen Yu:
Approximating the k -Set Packing Problem by Local Improvements. 408-420 - Kamel Zeltni, Souham Meshoul:
Multi-Objective Cuckoo Search with Leader Selection Strategies. 421-432 - Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, Emilio Carrizosa, Francisco Pérez-Galarce:
Vulnerability Assessment of Spatial Networks: Models and Solutions. 433-444
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-25 00:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
