Direct cut-off method for combinatorial optimization problems with additional constraints
From MaRDI portal
Recommendations
- Solving linear optimization problems on arrangements by the truncation method
- scientific article; zbMATH DE number 2206808
- scientific article; zbMATH DE number 2118655
- Solution of mixed combinatorial optimization problems on arrangements by the method of construction of lexicographic equivalence
- scientific article; zbMATH DE number 2168886
Cites work
- Algorithmic solution of two parametric optimization problems of a set of complete combinations
- Combinatorial optimization model of packing rectangles with stochastic parameters
- scientific article; zbMATH DE number 3801290 (Why is no real title available?)
- Method of ordering the values of a linear function on a set of permutations
- On the Solution of Problems of Nonlinear Conditional Optimization on Arrangements by the Cut-Off Method
- Solution of Euclidean combinatorial optimization problems by the method of construction of a lexicographic equivalence
- Solving linear optimization problems on arrangements by the truncation method
Cited in
(6)- Systems of linear equations with fuzzy set data: weak solvability and weak admissibility
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems
- Properties of the linear unconditional problem of combinatorial optimization on arrangements under probabilistic uncertainty
- scientific article; zbMATH DE number 1450273 (Why is no real title available?)
- scientific article; zbMATH DE number 2206808 (Why is no real title available?)
- A modification of the method of combinatorial truncation in optimization problems over vertex-located sets
This page was built for publication: Direct cut-off method for combinatorial optimization problems with additional constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q464988)
