Volume 150, Number 1, March 2007
Combinatorial Optimization and Application in Memory of Mario Lucertini
- Claudio Arbib, Fabrizio Rossi, Stefano Smriglio:
Annals of OR - Special volume in memory of Mario Lucertini.
1
- Alessandro Agnetis, Dario Pacciarelli, Andrea Pacifici:
Multi-agent single machine scheduling.
3-15
- Yalçin Akçay, Haijun Li, Susan H. Xu:
Greedy algorithm for the general multidimensional knapsack problem.
17-29
- Arianna Alfieri, Gaia Nicosia:
Minimum cost multi-product flow lines.
31-46
- Amir Azaron, Hideki Katagiri, Masatoshi Sakawa:
Time-cost trade-off via optimal control theory in Markov PERT networks.
47-64
- Ronald I. Becker, Isabella Lari, Andrea Scozzari, Giovanni Storchi:
The location of median paths on grid graphs.
65-78
- Renato Bruni:
Reformulation of the support set selection problem in the logical analysis of data.
79-92
- Gianfranco Ciaschetti, Lorenzo Corsini, Paolo Detti, Giovanni Giambene:
Packet scheduling in third-generation mobile systems with UTRA-TDD air interface.
93-114
- Giuseppe Confessore, Stefano Giordani, Silvia Rismondo:
A market-based multi-agent system model for decentralized multi-project scheduling.
115-135
- Federico Malucelli, Sara Nicoloso:
Shiftable intervals.
137-157
- Javier Marenco, Annegret Wagler:
Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems.
159-175
- Fabrizio Marinelli, Maria Elena Nenni, Antonio Sforza:
Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company.
177-192
- Petrica C. Pop:
On the prize-collecting generalized minimum spanning tree problem.
193-204
- Mauricio G. C. Resende, Renato Fonseca F. Werneck:
A fast swap-based local search procedure for location problems.
205-230
- Maria Grazia Scutellà:
A note on the parametric maximum flow problem and some related reoptimization issues.
231-244
Last update Sun May 19 23:49:23 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
