default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 164
Volume 164, Part 1, February 2014
- Dominique de Werra, Nelson Maculan, Ali Ridha Mahjoub:
Preface. 1 - Vicente Acuña, Carlos Eduardo Ferreira
, Alexandre S. Freire, Eduardo Moreno:
Solving the maximum edge biclique packing problem on unbalanced bipartite graphs. 2-12 - Laurent Alfandari, Jérôme Monnot:
A note on the Clustered Set Covering Problem. 13-19 - David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
Maximum size of a minimum watching system and the graphs achieving the bound. 20-33 - Laura Bahiense, Yuri Frota, Thiago F. Noronha, Celso C. Ribeiro:
A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives. 34-46 - Walid Ben-Ameur, Michal Pióro, Mateusz Zotkiewicz:
Fractional routing using pairs of failure-disjoint paths. 47-60 - Péter Biró, Eric McDermid:
Matching with sizes (or scheduling with processing set restrictions). 61-67 - Philippe Chrétienne, Pierre Fouilhoux, Éric Gourdin, Jean-Mathieu Segura:
The location-dispatching problem: Polyhedral results and content delivery network design. 68-85 - Jack Edmonds, Laura Sanità:
Exponentiality of the exchange algorithm for finding another room-partitioning. 86-91 - Cem Evrendilek, Burkay Genç, Brahim Hnich:
Covering points with orthogonal polygons. 92-99 - Virginie Gabrel, Mathieu Lacroix, Cécile Murat, Nabila Remli:
Robust location transportation problems under uncertain demands. 100-111 - Giulia Galbiati, Stefano Gualandi, Francesco Maffioli:
On Minimum Reload Cost Cycle Cover. 112-120 - Mette Gamst:
Exact and heuristic solution approaches for the Integrated Job Scheduling and Constrained Network Routing Problem. 121-137 - Maria Teresa Godinho, Luis Eduardo Neves Gouveia, Pierre Pesneau:
Natural and extended formulations for the Time-Dependent Traveling Salesman Problem. 138-153 - Imed Kacem, Hans Kellerer:
Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times. 154-160 - Segla Kpodjedo, Philippe Galinier, Giuliano Antoniol:
Using local similarity measures to efficiently address approximate graph matching. 161-177 - Valeria Leggieri, Mohamed Haouari, Chefi Triki:
The Steiner Tree Problem with Delays: A compact formulation and reduction procedures. 178-190 - Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon:
Complexity of colouring problems restricted to unichord-free and { square, unichord }-free graphs. 191-199 - Matthias Maischak, Andreas Krebs, Ernst P. Stephan:
Quasi-optimal degree distribution for a quadratic programming problem arising from the p-version finite element method for a one-dimensional obstacle problem. 200-209 - Leonardo Conegundes Martinez, Alexandre Salles da Cunha:
The min-degree constrained minimum spanning tree problem: Formulations and Branch-and-cut algorithm. 210-224 - Jean François Maurras, Thanh Hai Nguyen, Viet Hung Nguyen:
On the linear description of the Huffman trees polytope. 225-236 - Jean François Maurras, Ingo Spiegelberg, Rüdiger Stephan:
On cardinality constrained polymatroids. 237-245 - Isabel Méndez-Díaz, Juan José Miranda Bront, Gustavo J. Vulcano, Paula Zabala:
A branch-and-cut algorithm for the latent-class logit assortment problem. 246-263 - Roberto Quirino do Nascimento, Edson Figueiredo Lima Jr., Rubia Mara de Oliveira Santos:
A continuous strategy to solve a class of mixed optimization problems. 264-275 - Roberto Quirino do Nascimento, Ana Flávia Uzeda dos Santos Macambira, Lucídio dos Anjos Formiga Cabral, Renan Vicente Pinto:
The discrete ellipsoid covering problem: A discrete geometric programming approach. 276-285 - Sara Nicoloso, Ugo Pietropaoli:
On the chromatic number of Toeplitz graphs. 286-296 - Paulo Renato da Costa Pereira, Alex Garcia, Lilian Markenzon:
Generating and counting unlabeled k-path graphs. 297-303 - Mustafa Ç. Pinar:
Lower hedging of American contingent claims with minimal surplus risk in finite-state financial markets by mixed-integer linear programming. 304-312 - Rosiane de Freitas Rodrigues, Mitre Costa Dourado, Jayme Luiz Szwarcfiter:
Scheduling problem with multi-purpose parallel machines. 313-319 - Melanie Schmidt, Martin Skutella:
Earliest arrival flows in networks with multiple sinks. 320-327 - João Telhada:
Alternative MIP formulations for an integrated shift scheduling and task assignment problem. 328-343 - Ioan Tomescu, Salma Kanwal:
Unicyclic graphs of given girth k≥4 having smallest general sum-connectivity index. 344-348 - Rafal Witkowski:
A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs. 349-355
Volume 164, Part 2, February 2014
- Flavia Bonomo, Thomas M. Liebling, Javier Marenco, Jayme Luiz Szwarcfiter, Mario Valencia-Pabon:
LAGOS'11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina - 2011. 357-359 - Néstor E. Aguilera, Mariana S. Escalante, Pablo G. Fekete:
On the facets of lift-and-project relaxations under graph operations. 360-372 - Gabriela R. Argiroffo, Graciela L. Nasini, Pablo Daniel Torres:
The packing coloring problem for lobsters and partner limited graphs. 373-382 - George B. Mertzios, Ivona Bezáková:
Computing and counting longest paths on circular-arc graphs in polynomial time. 383-399 - Gordana Manic, Daniel M. Martin, Milos Stojakovic:
On Bichromatic Triangle Game. 400-405 - José A. Soto:
A simple PTAS for weighted matroid matching on strongly base orderable matroids. 406-412 - Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
A polyhedral approach for the equitable coloring problem. 413-426 - Guillermo Durán, Luciano N. Grippo, Martín Darío Safe:
Structural results on circular-arc graphs and circle graphs: A survey and the main open problems. 427-443 - Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul:
Contracting chordal graphs and bipartite graphs to paths and trees. 444-449 - Karla Roberta Lima, Yoshiko Wakabayashi:
Convex recoloring of paths. 450-459 - Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel:
Some advances on Lovász-Schrijver semidefinite programming relaxations of the fractional stable set polytope. 460-469 - Diana Sasaki, Simone Dantas, Celina M. H. de Figueiredo, Myriam Preissmann:
The hunting of a snark with total chromatic number 5. 470-481 - Liliana Alcón:
On asteroidal sets in chordal graphs. 482-491 - Sebastián Urrutia, Abilio Lucena:
Characterizing acyclic graphs by labeling edges. 492-499 - Pablo De Caria, Marisa Gutierrez:
On the correspondence between tree representations of chordal and dually chordal graphs. 500-511 - Jefferson L. M. da Silveira, Eduardo C. Xavier, Flávio Keidi Miyazawa:
Two-dimensional strip packing with unloading constraints. 512-521 - Ararat Harutyunyan:
Global offensive alliances in graphs and random graphs. 522-526 - Javier Marenco, Tomás Tetzlaff:
Envy-free division of discrete cakes. 527-531 - Aurélie Lagoutte, Mathilde Noual, Eric Thierry:
Flooding games on graphs. 532-538 - Victor A. Campos, Cláudia Linhares Sales, Rudini Menezes Sampaio, Ana Karolinna Maia:
Maximization coloring problems on graphs with few P4. 539-546 - Valeria A. Leoni, Graciela L. Nasini:
Limited Packing and Multiple Domination problems: Polynomial time reductions. 547-553
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-28 23:56 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:
