Paolo Toth

8편

• A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
  ms · 2001 · 인용 75 · Vehicle Routing Optimization Methods
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
  ms · 1999 · 인용 395 · Optimization and Packing Problems
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
  ms · 1997 · 인용 87 · Vehicle Routing Optimization Methods
• Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
  ms · 1993 · 인용 104 · Vehicle Routing Optimization Methods
• A New Algorithm for the 0-1 Knapsack Problem
  ms · 1988 · 인용 152 · Optimization and Packing Problems
• A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
  ms · 1984 · 인용 66 · Optimization and Packing Problems
• Erratum to “Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem”
  ms · 1981 · 인용 0 · Vehicle Routing Optimization Methods
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
  ms · 1980 · 인용 165 · Vehicle Routing Optimization Methods

• A5084320669Paolo Toth · 8편 · ORCID · 대표 기록
• A5080542531TothPaolo · 0편 · ORCID 보유자의 이름 변형