Enhanced mixed integer programming techniques and routing problems

DOI10.1007/s10288-010-0140-xzbMath1230.90042OpenAlexW2055407550MaRDI QIDQ657574

Andrea Tramontani

Publication date: 10 January 2012

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: http://amsdottorato.unibo.it/1754/1/tramontani_andrea_tesi.pdf

zbMATH Keywords

local searchmixed integer programmingbranch-and-cutvehicle routing problemstraveling salesman problem with time windowsdisjunctive cutstwo-row cuts

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Transferring information across restarts in MIP ⋮ Polyhedral approximation in mixed-integer convex optimization ⋮ A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows

Uses Software

• SCIP
• MIPLIB
• TSPTW
• XPRESS
• VRP
• VRPLIB
• CVRPSP

Cites Work

• On the separation of disjunctive cuts
• Lift-and-project for mixed 0-1 programming: recent progress
• An ILP improvement procedure for the open vehicle routing problem
• A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows
• An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems
• Experiments with Two Row Tableau Cuts
• Disjunctive Programming

This page was built for publication: Enhanced mixed integer programming techniques and routing problems