Παρακολούθηση
David Pisinger
David Pisinger
Prof., DTU Management, Technical University of Denmark (Adjoint Prof. University of Copenhagen)
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα man.dtu.dk - Αρχική σελίδα
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
Knapsack Problems
H Kellerer, U Pferschy, D Pisinger
Knapsack problems, 1-563, 2004
4625*2004
An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows
S Ropke, D Pisinger
Transportation science 40 (4), 455-472, 2006
28262006
A general heuristic for vehicle routing problems
D Pisinger, S Ropke
Computers & operations research 34 (8), 2403-2435, 2007
19742007
The three-dimensional bin packing problem
S Martello, D Pisinger, D Vigo
Operations research 48 (2), 256-267, 2000
10682000
Large neighborhood search
D Pisinger, S Ropke
Handbook of metaheuristics, 99-127, 2018
9832018
A unified heuristic for a large class of vehicle routing problems with backhauls
S Ropke, D Pisinger
European Journal of Operational Research 171 (3), 750-775, 2006
6752006
Where are the hard knapsack problems?
D Pisinger
Computers & Operations Research 32 (9), 2271-2284, 2005
6422005
Heuristics for the container loading problem
D Pisinger
European journal of operational research 141 (2), 382-392, 2002
6092002
Dynamic programming and strong bounds for the 0-1 knapsack problem
S Martello, D Pisinger, P Toth
Management science 45 (3), 414-424, 1999
5951999
Subset-row inequalities applied to the vehicle-routing problem with time windows
M Jepsen, B Petersen, S Spoorendonk, D Pisinger
OPERATIONS RESEARCH 56 (2), 497, 2008
5242008
Algorithms for knapsack problems
D Pisinger
Ph. D thesis, DIKU, University of Copenhagen, Repore 95/1, 1995
5031995
New trends in exact algorithms for the 0–1 knapsack problem
S Martello, D Pisinger, P Toth
European Journal of Operational Research 123 (2), 325-332, 2000
4602000
An adaptive large neighborhood search metaheuristic for the vehicle routing problem with drones
D Sacramento, D Pisinger, S Ropke
Transportation Research Part C: Emerging Technologies 102, 289-315, 2019
4452019
A minimal algorithm for the multiple-choice knapsack problem
D Pisinger
European Journal of Operational Research 83 (2), 394-410, 1995
3801995
A minimal algorithm for the 0-1 knapsack problem
D Pisinger
Operations Research 45 (5), 758-767, 1997
3531997
Guided local search for the three-dimensional bin-packing problem
O Faroe, D Pisinger, M Zachariasen
Informs journal on computing 15 (3), 267-283, 2003
3142003
A base integer programming model and benchmark suite for liner-shipping network design
BD Brouer, JF Alvarez, CEM Plum, D Pisinger, MM Sigurd
Transportation Science 48 (2), 281-312, 2014
2972014
The quadratic knapsack problem—a survey
D Pisinger
Discrete applied mathematics 155 (5), 623-648, 2007
2972007
Liner shipping hub network design in a competitive environment
S Gelareh, S Nickel, D Pisinger
Transportation Research Part E: Logistics and Transportation Review 46 (6 …, 2010
2742010
Exact solution of the quadratic knapsack problem
A Caprara, D Pisinger, P Toth
INFORMS Journal on Computing 11 (2), 125-137, 1999
2731999
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20