Volume 44,
Number 1,
August 2004
Volume 44,
Number 2,
September 2004
- Stefano Pallottino, Roberto Tadei:
Foreword.
59-60
- Matteo Fischetti, Carlo Polo, Massimo Scantamburlo:
A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem.
61-72
- Luigi De Giovanni, Federico Della Croce, Roberto Tadei:
On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints.
73-83
- Martine Labbé, Hande Yaman:
Projecting the flow variables for hub location problems.
84-93
- Giuliana Carello, Federico Della Croce, Marco Ghirardi, Roberto Tadei:
Solving the Hub location problem in telecommunication network design: A local search approach.
94-105
- Massimiliano Caramia, Stefano Giordani, Antonio Iovanella:
Grid scheduling by on-line rectangle packing.
106-119
- Nicola Apollonio, Lou Caccetta, Bruno Simeone:
Cardinality constrained path covering problems in grid graphs.
120-131
- Claudio Arbib, Stefano Smriglio, Mara Servilio:
A competitive scheduling problem and its relevance to UMTS channel assignment.
132-141
- Lihui Bai, Donald W. Hearn, Siriphong Lawphongpanich:
Decomposition techniques for the minimum toll revenue problem.
142-150
- Alessandro Agnetis, Fabrizio Rossi, Stefano Smriglio:
An implicit enumeration scheme for the batch selection problem.
151-159
- Ravindra K. Ahuja, Jian Liu, James B. Orlin, Jon Goodstein, Amit Mukherjee:
A neighborhood search algorithm for the combined through and fleet assignment model with time windows.
160-171
Volume 44,
Number 3,
October 2004
- Indra Rajasingh, Albert William, Jasintha Quadras, Paul Manuel:
Embedding of cycles and wheels into arbitrary trees.
173-178
- Jean-François Macq, Michel X. Goemans:
Trade-offs on the location of the core node in a network.
179-186
- Marcia Helena Costa Fampa, Sulamita Klein, Fábio Protti, Debora Cristina Alves Rêgo:
Optimal grid representations.
187-193
- Timothy Y. Chow, Philip J. Lin:
The ring grooming problem.
194-202
- Philip N. Klein, Radha Krishnan, Balaji Raghavachari, R. Ravi:
Approximation algorithms for finding low-degree subgraphs.
203-215
- Dominique Feillet, Pierre Dejax, Michel Gendreau, Cyrille Gueguen:
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems.
216-229
Volume 44,
Number 4,
December 2004
- Massimiliano Caramia, Paolo Dell'Olmo:
Bounding vertex coloring by truncated multistage branch and bound.
231-242
- Ján Plesník:
Minimum k-geodetically connected digraphs.
243-253
- Luis Gouveia, Thomas L. Magnanti, Cristina Requejo:
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees.
254-265
- Alberto Caprara, Andrea Lodi, Romeo Rizzi:
On d-threshold graphs and d-dimensional bin packing.
266-280
- Frédéric Havet, Marc Wennink:
The Push Tree problem.
281-291
- Min Xu, Xin-Min Hou, Jun-Ming Xu:
The proof of a conjecture of Bouabdallah and Sotteau.
292-296
- Satoru Iwata, Nozomu Zuiki:
A network flow approach to cost allocation for rooted trees.
297-301
- Jou-Ming Chang, Jinn-Shyong Yang, Yue-Li Wang, Yuwen Cheng:
Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs.
302-310
Copyright © Sat Nov 28 22:32:46 2009
by Michael Ley (ley@uni-trier.de)