default search action
Networks, Volume 62
Volume 62, Number 1, August 2013
- Chungmok Lee
, Kyungsik Lee, Sungsoo Park:
Benders decomposition approach for the robust network design problem with flow bifurcations. 1-16 - Sara Mattia:
A polyhedral study of the capacity formulation of the multilayer network design problem. 17-26 - A. H. Hunter, Nicholas Pippenger:
Local versus global search in channel graphs. 27-34 - Kaouther Drira, Hamida Seba, Brice Effantin
Distance edge coloring and collision-free communication in wireless sensor networks. 35-47 - D. Jacob Wildstrom:
Parametrized relocation of low-mobility resources. 48-55 - Minghe Sun
A branch-and-bound algorithm for representative integer efficient solutions in multiple objective network programming problems. 56-71 - Vic Baston, Kensaku Kikuta:
Search games on networks with travelling and search costs and with arbitrary searcher starting points. 72-79 - Dirk Briskorn
A note on "Multistage Methods for Freight Train Classification". 80-81
Volume 62, Number 2, September 2013
- Lasse Kliemann:
The price of anarchy in nonatomic consumption-relevance congestion games. 83-94 - Shin-Ichi Nakano, Ryuhei Uehara
Efficient algorithms for a simple network design problem. 95-104 - Sebastian Kluge, Konrad Reif, Martin Brokate:
Computation of the optimal value function in time-dependent networks. 105-124 - Clemens Thielen
Complexity and approximability of the maximum flow problem with minimum quantities. 125-131 - Lars Magnus Hvattum
Analysis of an exact algorithm for the vessel speed optimization problem. 132-135 - Balachandran Vaidyanathan:
Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs. 136-148 - Dritan Nace, Michal Pióro
Complexity of a classical flow restoration problem. 149-160 - Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Single bend paths on a grid have strong helly number 4: errata atque emendationes ad "edge intersection graphs of single bend paths on a grid". 161-163
Volume 62, Number 3, October 2013
- Dariusz Dereniowski
Optimal edge-coloring with edge rate constraints. 165-182 - Luigi Di Puglia Pugliese
A survey of resource constrained shortest path problems: Exact solution approaches. 183-200 - Asaf Levin
Nonoblivious 2-Opt heuristics for the traveling salesman problem. 201-219 - Qingqiong Cai, Xueliang Li, Jiangli Song:
Solutions to conjectures on the (k, ℓ)-rainbow index of complete graphs. 220-224 - Christopher Cullenbine, R. Kevin Wood
Theoretical and computational advances for network diversion. 225-242
Volume 62, Number 4, December 2013
- Miguel A. Lejeune
Effectiveness-equity models for facility location problems on tree networks. 243-254 - Frédéric Babonneau
Robust capacity assignment solutions for telecommunications networks with uncertain demands. 255-272 - Merve Bodur
Decomposition algorithms for solving the minimum weight maximal matching problem. 273-287 - James B. Orlin
Fast algorithms for convex cost flow problems on circles, lines, and trees. 288-296 - Agostinho Agra
A maritime inventory routing problem: Discrete time formulations and valid inequalities. 297-314 - Maurizio Boccia, Carlo Mannino, Igor Vasilyev
The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming. 315-326
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-29 01:26 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: