default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 179
Volume 179, Number 1, September 2010
- Graham Kendall
, Karen M. Daniels, Edmund K. Burke:
Preface. 1-3 - Albert Einstein Fernandes Muritiba, Manuel Iori, Silvano Martello, Marcos José Negreiros Gomes:
Models and algorithms for fair layout optimization problems. 5-14 - Celia A. Glass, Jeroen M. van Oostrum:
Bun splitting: a practical cutting stock problem. 15-33 - Adam Janiak, Andrzej Kozik, Maciej Lichtenstein:
New perspectives in VLSI design automation: deterministic packing by Sequence Pair. 35-56 - Maud Bay, Yves Crama, Yves Langer, Philippe Rigo:
Space and time allocation in a shipyard assembly hall. 57-76 - Peter M. Hahn, J. MacGregor Smith, Yi-Rong Zhu:
The Multi-Story Space Assignment Problem. 77-103 - Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová:
A supernodal formulation of vertex colouring with applications in course timetabling. 105-130 - Robert A. Russell, Timothy L. Urban:
The location and allocation of products and product families on retail shelves. 131-147 - Hasmukh K. Gajjar, Gajendra Kumar Adil:
A piecewise linearization for retail shelf space allocation problem and a local search heuristic. 149-167 - Douglas José Alem, Pedro Augusto Munari, Marcos Nereu Arenales, Paulo Augusto Valente Ferreira:
On the cutting stock problem under stochastic demand. 169-186 - Bassem Jarboui, Saber Ibrahim, Abdelwaheb Rebaï:
A new destructive bounding scheme for the bin packing problem. 187-202 - Francisco Parreño, Ramón Alvarez-Valdés, José Fernando Oliveira, José Manuel Tamarit:
A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing. 203-220 - Andrea Bettinelli, Alberto Ceselli, Giovanni Righini:
A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint. 221-241 - Volker Maag, Martin Berger, Anton Winterfeld, Karl-Heinz Küfer:
A novel non-linear approach to minimal area rectangular packing. 243-260 - Richard E. Korf, Michael D. Moffitt, Martha E. Pollack:
Optimal rectangle packing. 261-295 - Reinaldo Morabito, Vitória Pureza:
A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem. 297-315 - François Clautiaux, Cláudio Alves, José M. Valério de Carvalho:
A survey of dual-feasible and superadditive functions. 317-342 - Julia A. Bennell, Guntram Scheithauer, Yurij Stoyan, Tatiana E. Romanova:
Tools of mathematical modeling of arbitrary object packing problems. 343-368 - Hugo Terashima-Marín, Peter Ross, Cláudia J. Farías Zárate, Eunice López-Camacho, Manuel Valenzuela-Rendón:
Generalized hyper-heuristics for solving 2D Regular and Irregular Packing Problems. 369-392 - Philipp Rohlfshagen, John A. Bullinaria:
Nature inspired genetic algorithms for hard packing problems. 393-419
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 2025-11-01 22:09 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:
