A nonreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on arrangements
From MaRDI portal
Publication:2577240
DOI10.1007/s10559-005-0057-0zbMath1113.90131OpenAlexW2048884726MaRDI QIDQ2577240
Publication date: 19 December 2005
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-005-0057-0
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (2)
Solving optimization problems with linear-fractional objective functions and additional constraints on the arrangements ⋮ Analysis of an algorithm for solution of conditional optimization problems with linear-fractional objective functions over permutations
Cites Work
- Construction of convex continuations for functions defined on a hypersphere
- Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method
- Algorithmic solution of two parametric optimization problems of a set of complete combinations
- Extremal properties of nondifferentiable convex functions on euclidean sets of combinations with repetitions
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A nonreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on arrangements