Revisiting lagrange relaxation (LR) for processing large-scale mixed integer programming (MIP) problems [PDF]
, 2004 Lagrangean Relaxation has been successfully applied to process many well known instances of NP-hard Mixed Integer Programming problems. In this paper we present a Lagrangean Relaxation based generic solver for processing Mixed Integer Programming ...
Siamitros, C, Mitra, G, Poojari, CA
core +5 more sources
Non-convex mixed-integer nonlinear programming : a survey [PDF]
, 2012 A wide range of problems arising in practical applications can be formulated as Mixed-Integer Nonlinear Programs (MINLPs). For the case in which the objective and constraint functions are convex, some quite effective exact and heuristic algorithms are ...
Burer, S +3 more
core +4 more sources
Cutting plane methods for general integer programming [PDF]
, 1993 Integer programming (IP) problems are difficult to solve due to the integer restrictions imposed on them. A technique for solving these problems is the cutting plane method.
Mitra, G +5 more
core +6 more sources
New variants of variable neighbourhood search for 0-1 mixed integer programming and clustering [PDF]
, 2010 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Many real-world optimisation problems are discrete in nature.
Lazić, Jasmina
core +7 more sources
Reformulating mixed-integer quadratically constrained quadratic programs [PDF]
, 2011 It is well known that semidefinite programming (SDP) can be used to derive useful relaxations for a variety of optimisation problems. Moreover, in the particular case of mixed-integer quadratic programs, SDP has been used to reformulate problems, rather ...
Galli, L, Letchford, A. N.
core +4 more sources
Transformation of propositional calculus statements into integer and mixed integer programs: An approach towards automatic reformulation [PDF]
, 1990 A systematic procedure for transforming a set of logical statements or logical conditions imposed on a model into an Integer Linear Progamming (ILP) formulation Mixed Integer Programming (MIP) formulation is presented. An ILP stated as a system of linear
Hadjiconstantinou, E
core +6 more sources
FATCOP: A Fault Tolerant Condor-PVM Mixed Integer Programming Solver [PDF]
, 1999 We describe FATCOP, a new parallel mixed integer program solver written in PVM. The implementation uses the Condor resource management system to provide a virtual machine composed of otherwise idle computers.
Chen, Qun, Ferris, Michael
core
FATCOP 2.0: Advanced Features in an Opportunistic Mixed Integer Programming Solver [PDF]
, 2000 We describe FATCOP 2.0, a new parallel mixed integer program solver that works in an opportunistic computing environment provided by the Condor resource management system.
Linderoth, Jeff +2 more
core
Two row mixed integer cuts via lifting [PDF]
Recently, Andersen et al. [1], Borozan and Cornuéjols [6] and Cornuéjols and Margot [9] characterized extreme inequalities of a system of two rows with two free integer variables and nonnegative continuous variables.
WOLSEY, Laurence A., SANTANU, Dey
core
Application of mixed integer programming to a large scale logistics problem [PDF]
Integer Programming;Logistics ...
Westerhof, A.J. +2 more
core