The following pages link to (Q4382664):
Displaying 22 items.
- DASH: dynamic approach for switching heuristics (Q320816) (← links)
- A continuous bi-level model for the expansion of highway networks (Q336804) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- A lower bound for the non-oriented two-dimensional bin packing problem (Q1348248) (← links)
- On the approximation of the minimum disturbance \(p\)-facility location problem (Q1348254) (← links)
- Cuts, matrix completions and graph rigidity (Q1365058) (← links)
- Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809) (← links)
- Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope (Q1662101) (← links)
- Classes of quadratic assignment problem instances: Isomorphism and difficulty measure using a statistical approach (Q1850122) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments (Q2433800) (← links)
- A hierarchical location model for public facility planning (Q2456408) (← links)
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization (Q2496055) (← links)
- On pedigree polytopes and Hamiltonian cycles (Q2497514) (← links)
- Models and algorithms for three-stage two-dimensional bin packing (Q2643961) (← links)
- Arc-flow model for the two-dimensional guillotine cutting stock problem (Q2654387) (← links)
- Packing Problems in Space Solved by CPLEX: An Experimental Analysis (Q3133910) (← links)
- The Boolean Quadric Polytope (Q5050144) (← links)
- Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives (Q5270058) (← links)
- A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times (Q5943566) (← links)
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design (Q5946817) (← links)
- Improved dynamic programming algorithms for unconstrained two-dimensional guillotine cutting (Q6568431) (← links)
