Pages that link to "Item:Q2263322"
From MaRDI portal
The following pages link to The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations (Q2263322):
Displaying 3 items.
- Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method (Q465943) (← links)
- A graph-theoretic approach to multiobjective permutation-based optimization (Q1982918) (← links)
- Theory and methods of Euclidian combinatorial optimization: current status and prospects (Q2215570) (← links)