default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Notes in Discrete Mathematics, Volume 52
Volume 52, June 2016
- Michal Pióro
, Artur Tomaszewski, Jacek Rak:
International Network Optimization Conference, Warsaw, Poland 2015. 1-3 - B. Tounsi, Yezekael Hayel, Dominique Quadri, Luce Brotcorne:
Mathematical Programming with Stochastic Equilibrium Constraints applied to Optimal Last-mile Delivery Services. 5-12 - Dimitri Papadimitriou, Bernard Fortz:
Distributed Monitoring Problem. 13-20 - William Rogers, Paula Carroll:
Smart Meter Tariff Design to Minimise Wholesale Risk. 21-28 - Luis Cadarso, Ángel Marín:
Rapid transit network design considering risk aversion. 29-36 - J. Fabian Meier, Uwe Clausen, Borzou Rostami, Christoph Buchheim:
A Compact Linearisation of Euclidean Single Allocation Hub Location Problems. 37-44 - Christoph Buchheim, Jannis Kurtz:
Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions. 45-52 - Paola Cappanera, Maddalena Nonato, Filippo Visintin:
Routing hazardous materials by compulsory check points in case of variable demand. 53-60 - Antonio Capone, Michal Pióro, Yuan Li, Di Yuan:
On packet transmission scheduling for min-max delay and energy consumption in wireless mesh sensor networks. 61-68 - Borzou Rostami, Christoph Buchheim, J. Fabian Meier, Uwe Clausen:
Lower Bounding Procedures for the Single Allocation Hub Location Problem. 69-76 - Josselin Vallet, Olivier Brun, Balakrishna J. Prabhu:
A Game-theoretic Algorithm for Non-linear Single-Path Routing Problems. 77-84 - S. P. van Loggerenberg, Melvin Ferreira, Magdalena J. Grobler, S. E. Terblanche:
Benders Decomposition of the Passive Optical Network Design Problem. 85-92 - Guanglei Wang, Walid Ben-Ameur, José Neto, Adam Ouorou:
Optimal Mapping of Cloud Virtual Machines. 93-100 - Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser:
Models for minimum cost dominating trees. 101-107 - Sunil Chopra, Kangbok Lee, Minseok Ryu, Sangho Shim:
Separation Algorithm for Tree Partitioning Inequalities. 109-116 - Ibrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub, Raouia Taktak:
The k-node connected subgraph problem: Polyhedral analysis and Branch-and-Cut. 117-124 - Viet Hung Nguyen, Michel Minoux, Dang Phuong Nguyen:
Improved compact formulations for metric and cut polyhedra. 125-132 - Bernardetta Addis, Giuliana Carello, Sara Mattia:
Energy-aware survivable networks. 133-140 - Frédéric Giroire, Stephane Perennes, Issam Tahiri:
Grid spanners with low forwarding index for energy efficient networks. 141-148 - Fabio Furini, Virginie Gabrel, Ian-Christopher Ternier:
Lower Bounding Techniques for DSATUR-based Branch and Bound. 149-156 - Nadia Chaabane Fakhfakh, Cyril Briand, Marie-José Huguet:
Finding stable flows in multi-agent networks under an equal-sharing policy. 157-164 - Jinqiang Cheng, Abdel Lisser, Janny Leung:
Stochastic nonlinear resource allocation problem. 165-172 - Róza Goscien, Krzysztof Walkowiak, Miroslaw Klinkowski:
ILP modelling and joint optimization of anycast and unicast traffic in survivable elastic optical networks. 173-180 - Lilian Markenzon, Christina Fraga Esteves Maciel Waga:
Strictly Interval Graphs: Characterization and Linear Time Recognition. 181-188 - Christian Schauer, Günther R. Raidl:
A Multi-Commodity Flow Based Model for Multi Layer Hierarchical Ring Network Design. 189-196 - Edcarllos Santos, Luiz Satoru Ochi, Luidi Simonetti, Pedro Henrique González:
A Hybrid Heuristic based on Iterated Local Search for Multivehicle Inventory Routing Problem. 197-204 - Amaro de Sousa, Carlos B. Lopes, Paulo P. Monteiro:
Lightpath Admission Control in Dynamic Optical Transport Networks. 205-212 - Edoardo Amaldi, Stefano Coniglio, Arie M. C. A. Koster, Martin Tieves:
On the computational complexity of the virtual network embedding problem. 213-220 - Rosario Giuseppe Garroppo, Gianfranco Nencioni, Maria Grazia Scutellà, Luca Tavanti:
Robust optimisation of green wireless LANs under rate uncertainty and user mobility. 221-228 - Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman:
Hierarchical Survivable Network Design Problems. 229-236 - Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena:
A strong symmetric formulation for the Min-degree Constrained Minimum Spanning Tree Problem. 237-244 - Benjamin Biesinger, Bin Hu, Günther R. Raidl:
An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands. 245-252 - Gabriel Bayá, Antonio Mauttone, Franco Robledo, Pablo Romero:
Capacitated m Two-Node Survivable Star Problem. 253-260 - Merve Ekmen, Aysegül Altin-Kayhan:
A Conditional Multi-copy Strategy with Multiple Central Nodes for More Secure Wireless Sensor Networks. 261-268 - Filipe Pereira Alvelos, Xenia Klimentova, Abdur Rais, Ana Viana:
Maximizing expected number of transplants in kidney exchange programs. 269-276 - Rodolfo Alvizu, Guido Maier, Massimo Tornatore, Michal Pióro:
Differential delay constrained multipath routing for SDN and optical networks. 277-284 - Abilio Lucena, Luidi Simonetti, Alexandre Salles da Cunha:
The Tree-Star Problem: A Formulation and a Branch-and-Cut Algorithm. 285-292 - Xin Tang, Fabien Lehuédé, Olivier Péton:
Location of distribution centers in a multi-period collaborative distribution network. 293-300 - Ralf Borndörfer, Guillaume Sagnol, Stephan Schwartz:
An Extended Network Interdiction Problem for Optimal Toll Control. 301-308 - Vinicius Morais, Alexandre Salles da Cunha, Philippe Mahey:
A Branch-and-cut-and-price algorithm for the Stackelberg Minimum Spanning Tree Game. 309-316 - Celso Satoshi Sakuraba, Andréa Cynthia Santos, Christian Prins:
Work-troop scheduling for road network accessibility after a major earthquake. 317-324 - Giovanni Andreatta, M. Casula, Carla De Francesco, Luigi De Giovanni:
A branch-and-price based heuristic for the stochastic vehicle routing problem with hard time windows. 325-332 - Zacharie Alès, Arnaud Knippel:
An extended edge-representative formulation for the K-partitioning problem. 333-342 - Enrico Grande, Gaia Nicosia, Andrea Pacifici:
Minimum cost paths over dynamic networks. 343-350 - Frédéric Giroire, Frédéric Havet, Joanna Moulierac:
Compressing Two-dimensional Routing Tables with Order. 351-358 - Roberto Aringhieri, Andrea Grosso, Pierre Hosteins:
A Genetic Algorithm for a class of Critical Node Problems. 359-366 - Vorapong Suppakitpaisarn:
An Approximation Algorithm for Multiroute Flow Decomposition. 367-374 - Donatella Granata, Antonino Sgalambro:
Network Interdiction through Length-Bounded Critical Disruption Paths: a Bi-Objective Approach. 375-382
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-08-29 00: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.
