Results 61 to 70 of about 143 (125)
Extreme points of discrete location polyhedra
Extreme point, polyhedron, discrete location, 90C27, 90C10,
Alfredo Marín +2 more
core +1 more source
Lower and upper bounds for the linear arrangement problem on interval graphs [PDF]
International audienceWe deal here with the Linear Arrangement Problem (LAP) on interval graphs, any interval graph being given here together with its representation as the intersection graph of some collection of intervals, and so with related ...
Quilliot, Alain +5 more
core +1 more source
The two-convex-polygons TSP: A solvable case
Travelling salesman problem, convex polygon, dynamic programming, 90C27,
F. Tejel, Alfredo García
core +1 more source
Approximative solution methods for multiobjective combinatorial optimization
Multiobjective optimization, combinatorial optimization, heuristics, metaheuristics, approximation, 90C29, 90C27, 90C59,
Matthias Ehrgott, Xavier Gandibleux
core +1 more source
Applying mod-k-cuts for solving linear ordering problems
Linear ordering problem, Branch-and-cut, Mod-k cuts, 90C27, 90C57,
M. Oswald, H. Seitz, G. Reinelt
core +1 more source
Continuous facility location on graphs. [PDF]
Hartmann TA, Lendl S, Woeginger GJ.
europepmc +1 more source
On due-date based valid cuts for the sequential ordering problem
Integer Programming, Lagrangean relaxation, Hamiltonian Path, Valid Cuts, Tightening, 90C10, 90C27, 90C30,
L. Escudero, M. Ortuño
core +1 more source
A Metaheuristic Approach to Solving the Generalized Vertex Cover Problem [PDF]
AMS Subj. Classification: 90C27, 05C85, 90C59The topic is related to solving the generalized vertex cover problem (GVCP) by genetic algorithm. The problem is NP-hard as a generalization of well-known vertex cover problem which was one of the first problems
Milanović, Marija
core
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
Matroid bases with cardinality constraints on the intersection. [PDF]
Lendl S, Peis B, Timmermans V.
europepmc +1 more source

