default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 261
Volume 261, May 2019
- Yves Crama, Bernard Gendron, Bernard Ries
:
Preface: Tenth International Colloquium on Graphs and Optimization (GO X), 2016. 1 - I. Kuban Altinel, Necati Aras, Zeynep Suvak, Z. Caner Taskin:
Minimum cost noncrossing flow problem on layered networks. 2-21 - Claudio Arbib, Oya Ekin Karasan, Mustafa Ç. Pinar:
On envy-free perfect matching. 22-27 - Anna Arigliano, Gianpaolo Ghiani, Antonio Grieco, Emanuela Guerriero, Isaac Plana:
Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm. 28-39 - Laurent Beaudou, Florent Foucaud, Reza Naserasr:
Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphs. 40-51 - Lucila M. S. Bento, Davidson R. Boccardo, Raphael C. S. Machado, Flávio Keidi Miyazawa, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
Dijkstra graphs. 52-62 - Luca Bertazzi, Bruce L. Golden, Xingyin Wang:
The Bin Packing Problem with Item Fragmentation: A worst-case analysis. 63-77 - Flavia Bonomo, Diego de Estrada:
On the thinness and proper thinness of a graph. 78-92 - Marin Bougeret, Artur Alves Pessoa, Michael Poss:
Robust scheduling with budgeted uncertainty. 93-107 - Richard C. Brewster, Gary MacGillivray, Feiran Yang:
Broadcast domination and multipacking in strongly chordal graphs. 108-118 - Kathie Cameron, Chính T. Hoàng:
Solving the clique cover problem on (bull, C4)-free graphs. 119-122 - Anderson G. da Silva, Simone Dantas, Diana Sasaki:
Equitable total coloring of complete r-partite p-balanced graphs. 123-135 - Zakir Deniz, Tínaz Ekim:
Edge-stable equimatchable graphs. 136-147 - Andreas T. Ernst, Joey Fung, Gaurav Singh, Yakov Zinder:
Flexible flow shop with dedicated buffers. 148-163 - Rosa Figueiredo, Yuri Frota, Martine Labbé:
A branch-and-cut algorithm for the maximum k-balanced subgraph of a signed graph. 164-185 - Hanna Furmanczyk, Pawel Obszarski:
Equitable coloring of hypergraphs. 186-192 - Ana Luísa C. Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier:
Timber game as a counting problem. 193-202 - Bernard Gendron:
Revisiting Lagrangian relaxation for network design. 203-218 - Pavol Hell, César Hernández-Cruz, Cláudia Linhares Sales:
Minimal obstructions to 2-polar cographs. 219-228 - Alain Hertz, Romain Montagné, François Gagnon:
A comparison of integer programming models for the partial directed weighted improper coloring problem. 229-245 - Jing Huang, Josh Manzer:
Chronological rectangle digraphs which are two-terminal series-parallel. 246-257 - Marcin Kaminski, Anna Pstrucha:
Certifying coloring algorithms for graphs without long induced paths. 258-267 - Samia Kerdjoudj, André Raspaud:
List star edge-coloring of k-degenerate graphs and K4-minor free graphs. 268-275 - Martine Labbé, Luisa I. Martínez-Merino, Antonio M. Rodríguez-Chía:
Mixed integer linear programming for feature selection in support vector machine. 276-304 - Robert Lewon, Anna Malafiejska, Michal Malafiejski, Kacper Wereszko:
Global edge alliances in graphs. 305-315 - Marcio Costa Santos, Hannan Luss, Dritan Nace, Michael Poss:
Proportional and maxmin fairness for the sensor location problem with chance constraints. 316-331 - Alan J. Soper, Vitaly A. Strusevich:
Schedules with a single preemption on uniform parallel machines. 332-343 - Simon Thevenin, Nicolas Zufferey:
Learning Variable Neighborhood Search for a scheduling problem with time windows and rejections. 344-353
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 2026-07-20 23:18 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
