Experiments with the “Oregon Trail Knapsack Problem”

DOI10.1016/S1571-0653(04)00003-4zbMath0990.90537OpenAlexW2038481759MaRDI QIDQ2741262

John Ainsworth, Sheau-Dong Lang, Brian Casto, Jennifer J. Burg

Publication date: 23 September 2001

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0653(04)00003-4

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (1)

Optimal allocation of buffer times to increase train schedule robustness

Uses Software

• Oz

Cites Work

• Unnamed Item
• The pickup and delivery problem with time windows
• A permutation-based approach for solving the job-shop problem
• Computer science today. Recent trends and developments
• Solving various weighted matching problems with constraints
• Compiling constraints in clp(FD)
• Set Partitioning: A survey

This page was built for publication: Experiments with the “Oregon Trail Knapsack Problem”