Sciweavers

327 search results - page 21 / 66
» Cutting planes in integer and mixed integer programming
Sort
View
COR
2007
176views more  COR 2007»
15 years 1 months ago
Scheduling and routing of automated guided vehicles: A hybrid approach
We propose a hybrid method designed to solve a problem of dispatching and conflict free routing of automated guided vehicles (AGVs) in a flexible manufacturing system (FMS). Thi...
Ayoub Insa Corréa, André Langevin, L...
JAL
2008
139views more  JAL 2008»
15 years 1 months ago
A test suite for the evaluation of mixed multi-unit combinatorial auctions
Mixed Multi-Unit Combinatorial Auctions extend and generalize all the preceding types of combinatorial auctions. In this paper, we try to make headway on the practical application...
Meritxell Vinyals, Andrea Giovannucci, Jesú...
CPAIOR
2010
Springer
15 years 6 months ago
Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
Elvin Coban, John N. Hooker
MP
2006
100views more  MP 2006»
15 years 1 months ago
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
This paper addresses a multi-stage stochastic integer programming formulation of the uncapacitated lot-sizing problem under uncertainty. We show that the classical ( , S) inequalit...
Yongpei Guan, Shabbir Ahmed, George L. Nemhauser, ...
SIAMJO
2010
121views more  SIAMJO 2010»
14 years 11 months ago
Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid
Identifying small groups of lines, whose removal would cause a severe blackout, is critical for the secure operation of the electric power grid. We show how power grid vulnerabilit...
Ali Pinar, Juan Meza, Vaibhav Donde, Bernard C. Le...