The following pages link to David Pisinger (Q168068):
Displaying 50 items.
- Single string planning problem arising in liner shipping industries: a heuristic approach (Q336521) (← links)
- Single liner shipping service design (Q336948) (← links)
- The load-balanced multi-dimensional bin-packing problem (Q342477) (← links)
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times (Q439552) (← links)
- Multi-objective and multi-constrained non-additive shortest path problems (Q609807) (← links)
- Discrete location problems with push-pull objectives (Q697575) (← links)
- Optimal wafer cutting in shuttle layout problems (Q719028) (← links)
- Optimizing wind farm cable routing considering power losses (Q723994) (← links)
- A unified heuristic for a large class of vehicle routing problems with backhauls (Q819067) (← links)
- A general heuristic for vehicle routing problems (Q869003) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← links)
- Multi-dimensional bin packing problems with guillotine constraints (Q976021) (← links)
- Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem (Q1038381) (← links)
- Heuristics for container loading of furniture (Q1044119) (← links)
- An exact algorithm for large multiple knapsack problems (Q1124710) (← links)
- A fast algorithm for strongly correlated knapsack problems (Q1281395) (← links)
- Simple but efficient approaches for the collapsing knapsack problem (Q1364474) (← links)
- A minimal algorithm for the multiple-choice knapsack problem (Q1388832) (← links)
- Avoiding anomalies in the \(MT2\) algorithm by Martello and Toth (Q1388884) (← links)
- An expanding-core algorithm for the exact \(0-1\) knapsack problem (Q1390271) (← links)
- Guided local search for final placement in VLSI design (Q1402523) (← links)
- Dynamic programming on the word RAM (Q1566379) (← links)
- New trends in exact algorithms for the \(0-1\) knapsack problem (Q1569935) (← links)
- Approximation algorithms for knapsack problems with cardinality constraints (Q1569936) (← links)
- Competitive liner shipping network design (Q1652407) (← links)
- Optimizing the supply chain of biomass and biogas for a single plant considering mass and energy losses (Q1683108) (← links)
- Mixed integer linear programming for new trends in wind farm cable routing (Q1742210) (← links)
- Tolerance analysis for 0-1 knapsack problems (Q1751719) (← links)
- Where are the hard knapsack problems? (Q1772862) (← links)
- (Q1847184) (redirect page) (← links)
- Heuristics for the container loading problem (Q1847185) (← links)
- An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports (Q2023947) (← links)
- Modeling and solving the multimodal car- and ride-sharing problem (Q2030528) (← links)
- A branch-and-price algorithm for solving the single-hub feeder network design problem (Q2116907) (← links)
- Reducing disease spread through optimization: limiting mixture of the population is more important than limiting group sizes (Q2146973) (← links)
- Speed optimizations for liner networks with business constraints (Q2184075) (← links)
- Liner shipping network design (Q2184083) (← links)
- Finding a portfolio of near-optimal aggregated solutions to capacity expansion energy system models (Q2225646) (← links)
- Constraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports (Q2226489) (← links)
- Baggage carousel assignment at airports: model and case study (Q2226501) (← links)
- The vessel schedule recovery problem (VSRP) -- a MIP model for handling disruptions in liner shipping (Q2253442) (← links)
- A service flow model for the liner shipping network design problem (Q2256278) (← links)
- A comparative study of time aggregation techniques in relation to power capacity expansion modeling (Q2334464) (← links)
- Rejoinder on: ``A comparative study of time aggregation techniques in relation to power capacity-expansion modeling'' (Q2334466) (← links)
- A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
- Optimal annuity portfolio under inflation risk (Q2355721) (← links)
- Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← links)
- A combined stochastic programming and optimal control approach to personal finance and pensions (Q2516635) (← links)
- The two-dimensional bin packing problem with variable bin sizes and costs (Q2568334) (← links)
