Formulation of combinatorial optimization problems in AMPL language
Knapsack Problem, more
Subset Sum Problem, more
Bounded Knapsack Problem, more
Unbounded Knapsack Problem, more
d-Dimensional Knapsack Problem, more
k-Item Knapsack Problem, more
Multiple Knapsack Problem, more
Bottleneck Multiple Subset Sum Problem, more
Multiple-Choice Knapsack Problem, more
Generalized Multiple-Choice Knapsack Problem, more
Knapsack Sharing Problem, more
Two-Dimensional Two-Stage Cutting Problem, more
Cutting Stock Problem, more
Combinatorial Auctions Problem, more
Linear Sum Assignment Problem more
Linear Bottleneck Assignment Problem more
Axial 3-index Assignment Problem more
Planar 3-index Assignment Problem more
- LaTeX eqaution generated by Equation Editor for online mathematics
- U. Pferschy, D. Pisinger, Knapsack Problems, 2004, DOI
- R. Burkard, M. Dell’Amico, S. Martello, Assignment Problems, 2009, DOI