Solving a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements
From MaRDI portal
Publication:2263199
Recommendations
- Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method
- Solving linear optimization problems on arrangements by the truncation method
- Scientific article; zbMATH DE number 2118655
- Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method
- Solution of optimization problems with fractional-linear objective functions and additional linear constraints on permutations
Cites work
Cited in
(6)- scientific article; zbMATH DE number 2118655 (Why is no real title available?)
- Transportation problems on permutations: properties of estimates in the branch and bound method
- scientific article; zbMATH DE number 2168903 (Why is no real title available?)
- Solving linear optimization problems on arrangements by the truncation method
- scientific article; zbMATH DE number 1161294 (Why is no real title available?)
- Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method
This page was built for publication: Solving a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2263199)