Results 91 to 100 of about 39,293 (207)

A mixed integer linear programming model and a basic variable neighbourhood search algorithm for the repatriation scheduling problem. [PDF]

Expert Syst Appl, 2022
Al-Shihabi S, Mladenović N.
europepmc   +1 more source

A note on the split rank of intersection cuts [PDF]

In this note, we present a simple geometric argument to determine a lower bound on the split rank of intersection cuts. As a first step of this argument, a polyhedral subset of the lattice-free convex set that is used to generate the intersection cut is ...
SANTANU, Dey
core  

Um modelo revisado para escalonamento de compressores em campos de petróleo: desigualdades válidas e algoritmo de planos de corte [PDF]

, 2011
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico, Programa de Pós-Graduação em Engenharia de Automação e SistemasO projeto e escalonamento em tempo real de compressores para operar poços de petróleo com o método de ...
Nazari, Luis Fernando
core  

Modelling and solution methods for stochastic optimisation

, 2011
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.In this thesis we consider two research problems, namely, (i) language constructs for modelling stochastic programming (SP) problems and (ii) solution ...
Zverovich, Victor
core  

Application of mixed integer programming to a large scale logistics problem

Integer Programming;Logistics ...
Westerhof, A.J., Ashayeri, J., Alst, P.H.E.L. van   +2 more
core   +1 more source

Towards Foundation Models for Mixed Integer Linear Programming

CoRR
Mixed Integer Linear Programming (MILP) is essential for modeling complex decision-making problems but faces challenges in computational tractability and requires expert formulation. Current deep learning approaches for MILP focus on specific problem classes and do not generalize to unseen classes.
Sirui Li, Janardhan Kulkarni, Ishai Menache, Cathy Wu 0002, Beibin Li   +4 more
openaire   +3 more sources

Constrained infinite group relaxations of MIPs [PDF]

Recently minimal and extreme inequalities for continuous group relaxations of general mixed integer sets have been characterized. In this paper, we consider a stronger relaxation of general mixed integer sets by allowing constraints, such as bounds, on ...
DEY, Santanu S., WOLSEY, Laurence A.
core  

Design, implementation and testing of an integrated branch and bound algorithm for piecewise linear and discrete programming problems within an LP framework

, 1992
A number of discrete variable representations are well accepted and find regular use within LP systems. These are Binary variables, General Integer variables, Variable Upper Bounds or Semi Continuous variables, Special Ordered Sets of type One and type ...
Mitra, G, Hajian, MT
core  

Probability of Unique Integer Solution to a System of Linear Equations

, 2009
We consider a system of m linear equations in n variables Ax = d and give necessary and sufficient conditions for the existence of a unique solution to the system that is integer: x ? {?1,1}n.
Mangasarian, Olvi, Recht, Benjamin
core   +1 more source

An exact method for a discrete multiobjective linear fractional optimization

Integer linear fractional programming problem with multiple objective MOILFP is an important field of research and has not received as much attention as did multiple objective linear fractional programming.
Chergui, M. E-A, Moulai, M.
core   +1 more source