default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISCO 2018: Marrakesh, Morocco
- Jon Lee, Giovanni Rinaldi, Ali Ridha Mahjoub:
Combinatorial Optimization - 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers. Lecture Notes in Computer Science 10856, Springer 2018, ISBN 978-3-319-96150-7 - Faisal N. Abu-Khzam, Judith Egan, Serge Gaspers, Alexis Shaw
, Peter Shaw:
Cluster Editing with Vertex Splitting. 1-13 - Zacharie Alès, Sourour Elloumi:
Compact MILP Formulations for the p-Center Problem. 14-25 - José Carlos Almeida Jr., Felipe de Carvalho Pereira, Marina V. A. Reis, Breno Piva:
The Next Release Problem: Complexity, Exact Algorithms and Computations. 26-38 - Evangelos Anagnostopoulos, Ioannis Z. Emiris, Vissarion Fisikopoulos:
Polytope Membership in High Dimension. 39-51 - Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono:
Graph Orientation with Splits. 52-63 - Mourad Baïou, Rafael Colares, Hervé Kerivin:
The Stop Number Minimization Problem: Complexity and Polyhedral Analysis. 64-76 - Pierre-Olivier Bauguion, Claudia D'Ambrosio, Leo Liberti:
Maximum Concurrent Flow with Incomplete Data. 77-88 - Flavia Bonomo, María Pía Mazzoleni, Mariano Leonardo Rean, Bernard Ries:
Characterising Chordal Contact B_0 -VPG Graphs. 89-100 - Graham Cormode, Jacques Dark, Christian Konrad:
Approximating the Caro-Wei Bound for Independent Sets in Graph Streams. 101-114 - Denis Cornaz, Youcef Magnouche:
The Minimum Rooted-Cycle Cover Problem. 115-120 - Pierre Coupechoux, Marc Demange, David Ellison, Bertrand Jouve:
Online Firefighting on Trees. 121-132 - Ernando Gomes de Sousa, Rafael Castro de Andrade, Andréa Cynthia Santos:
A Multigraph Formulation for the Generalized Minimum Spanning Tree Problem. 133-143 - Bruno Dias, Rosiane de Freitas Rodrigues, Nelson Maculan, Javier Marenco:
The Distance Polytope for the Vertex Coloring Problem. 144-156 - Yuri Faenza, Igor Malinovic:
A PTAS for the Time-Invariant Incremental Knapsack Problem. 157-169 - Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson:
On Bounded Pitch Inequalities for the Min-Knapsack Polytope. 170-182 - Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Efficient Algorithms for Measuring the Funnel-Likeness of DAGs. 183-195 - Raquel Gerhardt, Tiago Neves, Luis Rangel:
Jointly Optimizing Replica Placement, Requests Distribution and Server Storage Capacity on Content Distribution Networks. 196-207 - Estèle Glize, Nicolas Jozefowiez, Sandra Ulrich Ngueveu:
An Exact Column Generation-Based Algorithm for Bi-objective Vehicle Routing Problems. 208-218 - Maria Isabel Gomes Salema, Lourdes B. Afonso, Nelson Chibeles-Martins, Joana M. Fradinho:
Multi-start Local Search Procedure for the Maximum Fire Risk Insured Capital Problem. 219-227 - Idir Hamaz, Laurent Houssin, Sonia Cafieri:
A Branch-and-Bound Procedure for the Robust Cyclic Job Shop Problem. 228-240 - Hipólito Hernández-Pérez, Juan José Salazar González:
An Exact Algorithm for the Split-Demand One-Commodity Pickup-and-delivery Travelling Salesman Problem. 241-252 - Olivier Hudry:
Descent with Mutations Applied to the Linear Ordering Problem. 253-264 - Matthias Köppe, Jiawei Wang:
Characterization and Approximation of Strong General Dual Feasible Functions. 265-276 - Christian Konrad, Tigran Tonoyan:
Preemptively Guessing the Center. 277-289 - Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Maria Inés Lopez Pujato, Martin Milanic:
Improved Algorithms for k-Domination and Total k-Domination in Proper Interval Graphs. 290-302 - Adam N. Letchford, Qiang Ni, Zhaoyu Zhong:
A Heuristic for Maximising Energy Efficiency in an OFDMA System Subject to QoS Constraints. 303-312 - David F. Manlove, Duncan Milne, Sofiat Olaosebikan:
An Integer Programming Approach to the Student-Project Allocation Problem with Preferences over Projects. 313-325 - Anders Martinsson, Florian Meier, Patrick Schnider, Angelika Steger:
Even Flying Cops Should Think Ahead. 326-337 - Massinissa Merabet, Jitamitra Desai, Miklós Molnár:
A Generalization of the Minimum Branch Vertices Spanning Tree Problem. 338-351 - José Neto:
A Polyhedral View to Generalized Multiple Domination and Limited Packing. 352-363 - Esteban Salgado, Andrea Scozzari, Fabio Tardella, Leo Liberti:
Alternating Current Optimal Power Flow with Generator Selection. 364-375 - Frank Sommer, Christian Komusiewicz:
Parameterized Algorithms for Module Map Problems. 376-388 - Jean-François Culus, Sophie Toulouse:
2 CSPs All Are Approximable Within a Constant Differential Factor. 389-401 - Alvaro Velasquez, K. Subramani, Steven L. Drager:
Finding Minimum Stopping and Trapping Sets: An Integer Linear Programming Approach. 402-415 - Annegret Wagler:
Lovász-Schrijver PSD-Operator on Some Graph Classes Defined by Clique Cutsets. 416-427
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 2024-10-01 20:32 CEST 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:
