Sciweavers

327 search results - page 19 / 66
» Cutting planes in integer and mixed integer programming
Sort
View
WSC
2004
15 years 2 months ago
New Advances and Applications for Marrying Simulation and Optimization
This tutorial will focus on several new real-world applications that have been developed using an integrated set of methods, including Tabu Search, Scatter Search, Mixed Integer P...
Jay April, Marco Better, Fred Glover, James P. Kel...
MP
2006
78views more  MP 2006»
15 years 1 months ago
Valid inequalities based on the interpolation procedure
We study the interpolation procedure of Gomory and Johnson (1972), which generates cutting planes for general integer programs from facets of cyclic group polyhedra. This idea has...
Sanjeeb Dash, Oktay Günlük
AAAI
1998
15 years 2 months ago
An Integer Local Search Method with Application to Capacitated Production Planning
Production planning is an important task in manufacturing systems. We consider a real-world capacitated lot-sizing problem (CLSP) from the process industry. Because the problem re...
Joachim P. Walser, Ramesh Iyer, Narayan Venkatasub...
IPCO
2008
188views Optimization» more  IPCO 2008»
15 years 2 months ago
Binary Positive Semidefinite Matrices and Associated Integer Polytopes
We consider the positive semidefinite (psd) matrices with binary entries. We give a characterisation of such matrices, along with a graphical representation. We then move on to co...
Adam N. Letchford, Michael M. Sørensen
FGCS
2008
109views more  FGCS 2008»
15 years 1 months ago
A grid-aware MIP solver: Implementation and case studies
This paper presents a grid-enabled system for solving large-scale mixed integer programming (MIP) problems. The system has been developed using Globus and MPICH-G2, and consists o...
Emilio Pasquale Mancini, Sonya Marcarelli, Igor Va...