default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Notes in Discrete Mathematics, Volume 64
Volume 64, February 2018
- Luís Gouveia, Pedro Moura:
Preface. 1-3 - Temel Öncan, I. Kuban Altinel:
A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints. 5-14 - Zacharie Alès, Thi Sang Nguyen, Michael Poss:
Minimizing the weighted sum of completion times under processing time uncertainty. 15-24 - Fabrizio Marinelli, Andrea Pizzuti
:
A Sequential Value Correction heuristic for a bi-objective two-dimensional bin-packing. 25-34 - Stephan Schwartz, Ralf Borndörfer, Gerald Bartz:
The Graph Segmentation Problem. 35-44 - Zhiyuan Lin, Raymond S. K. Kwan:
Redundant Coupling/decoupling in Train Unit Scheduling Optimization. 45-54 - Nair Maria Maia de Abreu, Lilian Markenzon:
Vulnerability of Subclasses of Chordal Graphs. 55-63 - Paulo Roberto de Oliveira da Costa, Stefano Mauceri, Paula Carroll, Fabiano Pallonetto:
A Genetic Algorithm for a Green Vehicle Routing Problem. 65-74 - Guido Perboli, Roberto Tadei, Edoardo Fadda:
New Valid Inequalities for the Two-Echelon Capacitated Vehicle Routing Problem. 75-84 - David Coudert, James R. Luedtke, Eduardo Moreno, Konstantinos Priftis:
Computing and maximizing the exact reliability of wireless backhaul networks. 85-94 - Marco Silva, Michael Poss, Nelson Maculan:
k-Adaptive Routing for the Robust Network Loading Problem. 95-104 - Jean-François Baffier, Pierre-Louis Poirion, Vorapong Suppakitpaisarn:
Bilevel Model for Adaptive Network Flow Problem. 105-114 - Martina Fischetti, David Pisinger:
Mixed Integer Linear Programming for new trends in wind farm cable routing. 115-124 - Enrico Grande, Gaia Nicosia, Andrea Pacifici, Vincenzo Roselli:
An exact algorithm for a multicommodity min-cost flow over time problem. 125-134 - Telmo Pinto, Cláudio Alves, José M. Valério de Carvalho:
Column generation based primal heuristics for routing and loading problems. 135-144 - Amadeu Almeida Coco, Andréa Cynthia Santos, Thiago F. Noronha:
Formulation and algorithms for the robust maximal covering location problem. 145-154 - Bruna Ramos, Cláudio Alves, José M. Valério de Carvalho:
Column Generation Based Approaches for Combined Routing and Scheduling. 155-164 - Fabio Barbosa, Amaro de Sousa, Agostinho Agra:
The Design of Transparent Optical Networks Minimizing the Impact of Critical Nodes. 165-174 - Yipeng Huang, Andréa Cynthia Santos, Christophe Duhamel:
Methods for solving road network problems with disruptions. 175-184 - Sebastien François, Rumen Andonov, Dominique Lavenier, Hristo N. Djidjev:
Global Optimization for Scaffolding and Completing Genome Assemblies. 185-194 - Enrico Malaguti, Giacomo Nannicini, Dimitri Thomopulos:
Optimizing allocation in a warehouse network. 195-204 - Braulio Antonio Mesquita Souza, Geraldo R. Mateus, Fernanda S. H. Souza:
Compact and Extended Formulations for the Virtual Network Embedding Problem. 205-214 - Fabio Furini, Enrico Malaguti, Sébastien Martin, Ian-Christopher Ternier:
ILP Models and Column Generation for the Minimum Sum Coloring Problem. 215-224 - Fabio D'Andreagiovanni, Rosario Giuseppe Garroppo, Maria Grazia Scutellà:
Green Design of Wireless Local Area Networks by Multiband Robust Optimization. 225-234 - Vincent Angilella, Walid Ben-Ameur, Matthieu Chardy:
Design of fiber cable tree FTTH networks. 235-244 - Christina Büsing, Martin Comis:
Budgeted Colored Matching Problems. 245-254 - Mikael Capelle, Marie-José Huguet, Nicolas Jozefowiez, Xavier Olive:
Ground stations networks for Free-Space Optical communications: maximizing the data transfer. 255-264 - Nicolas Huin, Andrea Tomassilli, Frédéric Giroire, Brigitte Jaumard:
Energy-Efficient Service Function Chain Provisioning. 265-274 - Guillaume Sagnol, Marco Blanco, Thibaut Sauvage:
Approximation Hierarchies for the cone of flow matrices. 275-284 - Maddalena Nonato, Davide Bertozzi, Marco Gavanelli, Andrea Peano:
A network model for routing-fault-free wavelength selection in WRONoCs design. 285-294 - Ali Ridha Mahjoub, Mohamed Yassine Naghmouchi, Nancy Perrot:
A Bilevel Programming Model for Proactive Countermeasure Selection in Complex ICT Systems. 295-304 - Ibrahima Diarrassouba, Mohamed Khalil Labidi, Ali Ridha Mahjoub:
A Hybrid Optimization Approach For the Steiner k-Connected Network Design Problem. 305-314 - Ibrahima Diarrassouba, Pedro Henrique P. V. Liguori, Ali Ridha Mahjoub:
The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut. 315-324 - Dorabella Santos, Amaro de Sousa, Paulo P. Monteiro:
Compact Models for Critical Node Detection in Telecommunication Networks. 325-334 - Julian Enoch, Brigitte Jaumard:
Towards Optimal and Scalable Solution for Routing and Spectrum Allocation. 335-344 - Agostinho Agra, Cristina Requejo, Filipe Rodrigues:
A hybrid heuristic for a stochastic production-inventory-routing problem. 345-354 - Michal Pióro, Ilya Kalesnikau, Michael Poss:
Path Generation for Affine Flow Thinning. 355-364 - Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion, Thomas Ridremont:
Formulations for designing robust networks. An application to wind power collection. 365-374
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-12-15 01:17 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:
