Results 41 to 50 of about 104 (98)
Improving strong branching by domain propagation
EURO Journal on Computational Optimization, 2014 One of the essential components of a branch-and-bound based mixed-integer linear programming (MIP) solver is the branching rule. Strong branching is a method used by many state-of-the-art branching rules to select the variable to branch on.
Gerald Gamrath
doaj +1 more source
Integer decomposition for polyhedra defined by nearly totally unimodular matrices. [PDF]
, 2005 . We call a matrix $A$ nearly totally unimodular if it can be obtained from a totally unimodular matrix $\tilde{A}$ by adding to each row of $\tilde{A}$ an integer multiple of some fixed row $a^{\transp}$ of $\tilde{A}$.
Gijswijt, D.C. +2 more
core +2 more sources
Solving the plant location problem on a line by linear programming
Plant location, Linear programming, Integer friendliness, 90B80, 90C10,
Jack Brimberg, Charles ReVelle
core +1 more source
Extreme points of discrete location polyhedra
Extreme point, polyhedron, discrete location, 90C27, 90C10,
Alfredo Marín +2 more
core +1 more source
The stochastic generalised assignment problem with Bernoulli demands
Generalized Assignment Problem, Stochastic Optimization, Heuristics, 90C15, 90C10, 90C27,
Maria Albareda-Sambola, Elena Fernández
core +1 more source
Discrete location for bundled demand points
Discrete location, Lagrangian relaxation, Valid inequalities, 90B80, 90C10,
Alfredo Marín
core +1 more source
An optimal decision making model for supporting week hospital management
Health care services, Week hospital, Patient scheduling, Decision making problem, Mathematical programming, 90B35, 90C10,
Marco Cerinic +4 more
core +1 more source
An extension to rapid transit network design problem
Underground train station and alignment location, Rapid transit network design, 90B06, 90C10, 90C35,
Ángel Marín
core +1 more source
A comparison of algorithm RS with algorithm OPTSOL70
Location, Set-Covering, Heuristics, 90C10, 90C27,
Jesús Pastor, Marc Almiñana
core +1 more source
A note for tightening 0–1 models
Tighter formulations, Covers, Cliques, Equivalency, Redundancy, 90C10, 90C05,
Laureano Escudero, Susana Muñoz
core +1 more source