Pages that link to "Item:Q465943"

The following pages link to Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method (Q465943):

Displaying 6 items.

• Properties of the linear unconditional problem of combinatorial optimization on arrangements under probabilistic uncertainty (Q315017) (← links)
• A method to solve conditional optimization problems with quadratic objective functions on the set of permutations (Q2215299) (← links)
• Transportation problems on permutations: properties of estimates in the branch and bound method (Q2247817) (← links)
• Solving a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements (Q2263199) (← links)
• The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations (Q2263322) (← links)
• A monotone iterative method for solving the combinatorial game-type optimization problems on permutations (Q2933215) (← links)