Mixed integer programming formulations for the generalized traveling salesman problem with time windows (Q6057720): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the generalized traveling salesman problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows / rank
 
Normal rank

Latest revision as of 08:45, 3 August 2024

scientific article; zbMATH DE number 7755406
Language Label Description Also known as
English
Mixed integer programming formulations for the generalized traveling salesman problem with time windows
scientific article; zbMATH DE number 7755406

    Statements

    Identifiers