Results 41 to 50 of about 105 (99)
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
A comparison of algorithm RS with algorithm OPTSOL70
Location, Set-Covering, Heuristics, 90C10, 90C27,
Jesús Pastor, Marc Almiñana
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
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
A note for tightening 0–1 models
Tighter formulations, Covers, Cliques, Equivalency, Redundancy, 90C10, 90C05,
Laureano Escudero, Susana Muñoz
core +1 more source
Multi-period location-assignment, Pure 0–1 formulations, Impulse variables, Step variables, 90B80, 90C10, 90B06,
Celeste Pizarro-Romero +5 more
core +1 more source
Wind tunnel measurement dataset of 3D turbulent flow around a group of generic buildings with and without a high-rise building. [PDF]
Data Brief, 2021 Tominaga Y, Shirzadi M.
europepmc +1 more source
Improved algorithms for the multicut and multiflow problems in rooted trees
Maximum integral multiflows, Minimum multicuts, Totally balanced matrices, Greedy matrices, Rooted trees, 90C27, 90C10,
A. Tamir
core +1 more source