Sciweavers

2976 search results - page 362 / 596
» On the bounded integer programming
Sort
View
COR
2008
99views more  COR 2008»
15 years 4 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
EOR
2008
97views more  EOR 2008»
15 years 4 months ago
Optimization models for the single delay management problem in public transportation
Passengers travelling in public transportation networks often have to use different lines to cover the trip from their origin to the desired destination. As a consequence, the rel...
Géraldine Heilporn, Luigi De Giovanni, Mart...
MP
2006
101views more  MP 2006»
15 years 4 months ago
Robust optimization of contaminant sensor placement for community water systems
We present a series of related robust optimization models for placing sensors in municipal water networks to detect contaminants that are maliciously or accidentally injected. We f...
Robert D. Carr, Harvey J. Greenberg, William E. Ha...
TCAD
2008
106views more  TCAD 2008»
15 years 4 months ago
Track Routing and Optimization for Yield
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
Minsik Cho, Hua Xiang, Ruchir Puri, David Z. Pan
JCO
1998
136views more  JCO 1998»
15 years 4 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...