Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 68
Volume 68, Number 1, August 2016
Preface
- Gary A. Kochenberger, Fred W. Glover:
Preface to the 2nd Special Issue on metaheuristics in network optimization. 3
- Goutam Sen, Mohan Krishnamoorthy
, Narayan Rangaraj, Vishnu Narayanan:
Mathematical models and empirical analysis of a simulated annealing approach for two variants of the static data segment allocation problem. 4-22 - César Rego, Dorabela Gamboa, Fred W. Glover:
Doubly-rooted stem-and-cycle ejection chain algorithm for the asymmetric traveling salesman problem. 23-33 - Fabián Castaño, Eric Bourreau, André Rossi, Marc Sevaux, Nubia Velasco:
Partial target coverage to extend the lifetime in wireless multi-role sensor networks. 34-53 - Mauro Cardoso Lopes, Carlos Eduardo de Andrade, Thiago Alves de Queiroz, Mauricio G. C. Resende, Flávio Keidi Miyazawa:
Heuristics for a hub location-routing problem. 54-90
Volume 68, Number 2, September 2016
- Bruce L. Golden, Douglas R. Shier:
Editorial. 93
- Inge Li Gørtz, Viswanath Nagarajan:
Locating depots for capacitated vehicle routing. 94-103 - Pierre-Louis Poirion, Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti:
The power edge set problem. 104-120 - Imke Joormann, James B. Orlin, Marc E. Pfetsch:
A characterization of irreducible infeasible subsystems in flow networks. 121-129 - Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman:
The ring/κ-rings network design problem: Model and branch-and-cut algorithm. 130-140 - André B. Chassein, Sven O. Krumke, Clemens Thielen:
Capacitated network design games with weighted players. 141-158
Volume 68, Number 3, October 2016
- Lukas Bach, Jens Lysgaard, Sanne Wøhlk:
A branch-and-cut-and-price algorithm for the mixed capacitated general routing problem. 161-184 - Hassene Aissi, Daniel Vanderpooten:
Robust capacity expansion of a network under demand uncertainty: A bi-objective approach. 185-199 - Adam Ouorou:
Robust models for linear programming with uncertain right hand side. 200-211 - Remy Spliet, Rommert Dekker:
The driver assignment vehicle routing problem. 212-223 - Marco Tarifeño-Gajardo, Alejandra Beghelli, Eduardo Moreno:
Availability-driven optimal design of shared path protection in WDM networks. 224-237 - Jason I. Brown, Lucas Mol:
On the roots of the node reliability polynomial. 238-246
Volume 68, Number 4, December 2016
- Bruce L. Golden, Douglas R. Shier:
Editorial. 249
- Marcin Kaminski, Daniël Paulusma, Anthony Stewart, Dimitrios M. Thilikos:
Minimal disconnected cuts in planar graphs. 250-259 - Selene Silvestri, Gilbert Laporte, Raffaele Cerulli:
The Rainbow Cycle Cover Problem. 260-270 - Zvi Drezner, Carlton H. Scott, John G. Turner:
Mixed planar and network single-facility location problems. 271-282 - Chrysanthos E. Gounaris, Karthikeyan Rajendran, Ioannis G. Kevrekidis, Christodoulos A. Floudas:
Designing networks: A mixed-integer linear optimization approach. 283-301 - Patrick J. Andersen, Charl J. Ras:
Minimum bottleneck spanning trees with degree bounds. 302-314 - Jorge A. Sefair, J. Cole Smith:
Dynamic shortest-path interdiction. 315-330 - Yen Hung Chen:
The bottleneck selected-internal and partial terminal Steiner tree problems. 331-339
a service of 
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-04-18 21:19 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:
