Sciweavers

6894 search results - page 141 / 1379
» Generation Problems
Sort
View
CP
2001
Springer
15 years 11 months ago
A CLP Approach to the Protein Side-Chain Placement Problem
Abstract. Selecting conformations for side-chains is an important subtask in building three-dimensional protein models. Side-chain placement is a difficult problem because of the l...
Martin T. Swain, Graham J. L. Kemp
4OR
2008
79views more  4OR 2008»
15 years 6 months ago
MIP-based heuristic for non-standard 3D-packing problems
This paper is the continuation of a previous work (Fasano 2004), dedicated to a MIP formulation for non-standard three-dimensional packing issues, with additional conditions. The ...
Giorgio Fasano
COR
2010
177views more  COR 2010»
15 years 6 months ago
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
Verena Schmid, Karl F. Doerner, Richard F. Hartl, ...
COR
2007
80views more  COR 2007»
15 years 6 months ago
A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
In this paper we present an ant-based algorithm for solving unconstrained multi-level lot-sizing problems called ant system for multi-level lot-sizing algorithm (ASMLLS). We apply...
Rapeepan Pitakaso, Christian Almeder, Karl F. Doer...
JCO
2007
123views more  JCO 2007»
15 years 6 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...