Results 11 to 20 of about 3,313,551 (282)
Reformulating mixed-integer quadratically constrained quadratic programs [PDF]
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
Cutting planes in integer and mixed integer programming [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hugues Marchand +3 more
openaire +3 more sources
Revisiting lagrange relaxation (LR) for processing large-scale mixed integer programming (MIP) problems [PDF]
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 +4 more sources
On convergence in mixed integer programming [PDF]
ISSN:1436 ...
Alberto Del Pia, Robert Weismantel
openaire +4 more sources
With a growing percentage of elderly or disabled people in our society, the number of people not being able to drive a car themselves, or even to go by bus, increases, too. Specific services are required to address mobility demands, and dial-a-ride systems have been developed to provide an appropriate answer.
Jon Lee 0001, Adam N. Letchford
openaire +3 more sources
Transformation of propositional calculus statements into integer and mixed integer programs: An approach towards automatic reformulation [PDF]
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 +4 more sources
Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs [PDF]
11 ...
Köppe, Matthias +2 more
openaire +6 more sources
Mixed-integer quadratic programming is in NP [PDF]
Mixed-integer quadratic programming is the problem of optimizing a quadratic function over points in a polyhedral set where some of the components are restricted to be integral. In this paper, we prove that the decision version of mixed-integer quadratic programming is in NP, thereby showing that it is NP-complete.
Alberto Del Pia +2 more
openaire +4 more sources
Network Formulations of Mixed-Integer Programs [PDF]
We consider mixed-integer sets described by system of linear inequalities in which the constraint matrix A is totally unimodular; the right-hand side is arbitrary vector; and a subset of the variables is required to be integer. We show that the problem of checking nonemptiness of a set of this type is NP-complete, even in the case in which the linear ...
CONFORTI, MICHELANGELO +3 more
openaire +8 more sources
On mixed-integer random convex programs [PDF]
We consider a class of mixed-integer optimization problems subject to N randomly drawn convex constraints. We provide explicit bounds on the tails of the probability that the optimal solution found under these N constraints will become infeasible for the next random constraint.
Giuseppe Carlo Calafiore +2 more
openaire +2 more sources

