PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Ernst, Andreas T."

Author of the publication

copydeleteadd this publication to your clipboard
The 2-allocation p-hub median problem and a modified Benders decomposition method for solving hub location problems.

, , and . Computers & OR, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

T. Ertl

Univ. -Prof. Dr. Ernst Messerschmid University of Stuttgart

T. Vietor

T. Maier

T. Maier

 

Other publications of authors with the same name

An Annotated Bibliography of Personnel Scheduling and Rostering., , , , and . Annals OR, 127 (1-4): 21-144 (2004)Hub Arc Location Problems: Part II - Formulations and Optimal Algorithms., , and . Management Science, 51 (10): 1556-1571 (2005)Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations., , , , and . Computers & OR, (2014)A 2-phase algorithm for solving the single allocation p-hub center problem., , and . Computers & OR, 36 (12): 3143-3151 (2009)A hybrid Lagrangian Particle Swarm Optimization Algorithm for the degree-constrained minimum spanning tree problem.. IEEE Congress on Evolutionary Computation, page 1-8. IEEE, (2010)Scheduling Meetings at Trade Events with Complex Preferences., , and . ICAPS, page 76-82. AAAI, (2008)New models and algorithms for the container stack rearrangement problem by yard cranes in maritime ports., , , , and . EURO J. Transportation and Logistics, 6 (4): 307-348 (2017)Parallel ant colony optimization for resource constrained job scheduling., , and . Annals OR, 242 (2): 355-372 (2016)Decomposition for Large-scale Optimization Problems with Overlapping Components., , , and . CEC, page 326-333. IEEE, (2019)A Population-based Local Search Technique with Random Descent and Jump for the Steiner Tree Problem in Graphs., , , and . GECCO, page 333-340. ACM, (2016)