Sciweavers

327 search results - page 49 / 66
» Cutting planes in integer and mixed integer programming
Sort
View
ICCV
2009
IEEE
16 years 4 months ago
Image Segmentation with A Bounding Box Prior
User-provided object bounding box is a simple and popular interaction paradigm considered by many existing interactive image segmentation frameworks. However, these frameworks t...
Victor Lempitsky, Pushmeet Kohli, Carsten Rother, ...
CASES
2006
ACM
15 years 5 months ago
A dynamic code placement technique for scratchpad memory using postpass optimization
In this paper, we propose a fully automatic dynamic scratchpad memory (SPM) management technique for instructions. Our technique loads required code segments into the SPM on deman...
Bernhard Egger, Chihun Kim, Choonki Jang, Yoonsung...
ICTAI
1999
IEEE
15 years 4 months ago
Search Strategies for Hybrid Search Spaces
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
Carla P. Gomes, Bart Selman
COR
2008
99views more  COR 2008»
14 years 11 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi
MP
2006
120views more  MP 2006»
14 years 11 months ago
Lot-sizing with production and delivery time windows
We study two different lot-sizing problems with time windows that have been proposed recently. For the case of production time windows, in which each client specific order must be ...
Laurence A. Wolsey