Results 131 to 140 of about 9,369 (164)
Some of the next articles are maybe not open access.

Valid Linear Programming Bounds for Exact Mixed-Integer Programming

INFORMS Journal on Computing, 2013
Fast computation of valid linear programming (LP) bounds serves as an important subroutine for solving mixed-integer programming problems exactly. We introduce a new method for computing valid LP bounds designed for this application. The algorithm corrects approximate LP dual solutions to be exactly feasible, giving a valid bound.
Daniel E. Steffy, Kati Wolter
openaire   +1 more source

Testing cut generators for mixed-integer linear programming

Mathematical Programming Computation, 2009
In this paper, a methodology for testing the accuracy and strength of cut generators for mixed-integer linear programming is presented. The procedure amounts to random diving towards a feasible solution, recording several kinds of failures. This allows for a ranking of the accuracy of the generators. Then, for generators deemed to have similar accuracy,
openaire   +1 more source

Mixed integer linear programming formulations for probabilistic constraints

Operations Research Letters, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Juan Pablo Vielma   +2 more
openaire   +3 more sources

An algorithm for multiparametric mixed-integer linear programming problems

Operations Research Letters, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joaquín Acevedo   +1 more
openaire   +2 more sources

Mixed Integer Linear Programming for Mixed Integer Quadratic Programming

2003
Abstract. In this paper we consider the mixed integer general quadratic problem (MIGQP) that consists in maximizing a quadratic function subject to quadratic constraints, with three types of variables: binary, integer and real. Given a precision , we show how to associate two mixed integer linear programs and with MIGQP.
openaire   +1 more source

Leveraging linear and mixed integer programming for SMT

2014 Formal Methods in Computer-Aided Design (FMCAD), 2014
Tim King 0001   +2 more
openaire   +3 more sources

Valid Inequalities for Mixed-Integer Linear and Mixed-Integer Conic Programs

2016
Mixed-integer programming provides a natural framework for modeling optimization problems which require discrete decisions. Valid inequalities, used as cutting-planes and cuttingsurfaces in integer programming solvers, are an essential part of today’s integer programming technology.
openaire   +1 more source

An Algorithm for the Solution of Multiparametric Mixed Integer Linear Programming Problems

Annals of Operations Research, 2000
Pistikopoulos, Stratos, Vivek Dua
exaly  

Home - About - Disclaimer - Privacy