The following pages link to David Pisinger (Q168068):
Displaying 19 items.
- Multi-objective and multi-constrained non-additive shortest path problems (Q609807) (← links)
- A unified heuristic for a large class of vehicle routing problems with backhauls (Q819067) (← links)
- Heuristics for container loading of furniture (Q1044119) (← links)
- A fast algorithm for strongly correlated knapsack problems (Q1281395) (← links)
- Simple but efficient approaches for the collapsing knapsack problem (Q1364474) (← links)
- Dynamic programming on the word RAM (Q1566379) (← links)
- Competitive liner shipping network design (Q1652407) (← links)
- Tolerance analysis for 0-1 knapsack problems (Q1751719) (← links)
- Heuristics for the container loading problem (Q1847185) (← links)
- A service flow model for the liner shipping network design problem (Q2256278) (← links)
- A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
- Optimal annuity portfolio under inflation risk (Q2355721) (← links)
- Guided Local Search for the Three-Dimensional Bin-Packing Problem (Q2884559) (← links)
- Denser Packings Obtained in <i>O</i>(<i>n</i> log log <i>n</i>) Time (Q2892352) (← links)
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows (Q3392186) (← links)
- A Minimal Algorithm for the Bounded Knapsack Problem (Q4427321) (← links)
- Scheduling of outbound luggage handling at airports (Q5176308) (← links)
- Interactive Cost Configuration Over Decision Diagrams (Q5190268) (← links)
- Budgeting with bounded multiple-choice constraints. (Q5928374) (← links)
