Results 61 to 70 of about 148 (126)
Vanishing of Schubert coefficients via the effective Hilbert nullstellensatz
Schubert Vanishing is a problem of deciding whether Schubert coefficients are zero. Until this work it was open whether this problem is in the polynomial hierarchy ${{\mathsf {PH}}}$ .
Igor Pak, Colleen Robichaux
doaj +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 two-convex-polygons TSP: A solvable case
Travelling salesman problem, convex polygon, dynamic programming, 90C27,
F. Tejel, Alfredo García
core +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
Two level hierarchical time minimizing transportation problem
Global optimization, concave minimization problem, time minimizing transportation problem, hierarchical optimization, 90C27, 90C26, 90C08, 90C90,
Sonia, Munish Puri
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
Continuous facility location on graphs. [PDF]
Hartmann TA, Lendl S, Woeginger GJ.
europepmc +1 more source
Matroid bases with cardinality constraints on the intersection. [PDF]
Lendl S, Peis B, Timmermans V.
europepmc +1 more source
A technique for obtaining true approximations for k-center with covering constraints. [PDF]
Anegg G +3 more
europepmc +1 more source

