Sciweavers

591 search results - page 27 / 119
» A constraint programming approach to cutset problems
Sort
View
CPAIOR
2009
Springer
14 years 3 months ago
A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan
CCO
2001
Springer
168views Combinatorics» more  CCO 2001»
14 years 29 days ago
Mathematical Programming Models and Formulations for Deterministic Production Planning Problems
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
Yves Pochet
IPCO
2008
163views Optimization» more  IPCO 2008»
13 years 10 months ago
The Air Traffic Flow Management Problem: An Integer Optimization Approach
In this paper, we present a new Integer Program (IP) for the Air Traffic Flow Management (ATFM) problem. The model we propose provides a complete representation of all the phases o...
Dimitris Bertsimas, Guglielmo Lulli, Amedeo R. Odo...
IEEEPACT
1998
IEEE
14 years 21 days ago
A Matrix-Based Approach to the Global Locality Optimization Problem
Global locality analysis is a technique for improving the cache performance of a sequence of loop nests through a combination of loop and data layout optimizations. Pure loop tran...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
PARA
1995
Springer
13 years 12 months ago
Decomposing Linear Programs for Parallel Solution
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...
Ali Pinar, Ümit V. Çatalyürek, Ce...