Enhanced mixed integer programming techniques and routing problems

DOI10.1007/S10288-010-0140-XMaRDI QIDQ657574zbMATH OpenOpenAlexFDO

Authors 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 searchbranch-and-cutmixed integer programmingvehicle routing problemstraveling salesman problem with time windowsdisjunctive cutstwo-row cuts

Mathematics Subject Classification ID

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

Recommendations

• Enhancing CP-based column generation for integer programs
• Application-oriented mixed integer non-linear programming
• Integrating local search techniques into mixed integer programming. (Thesis)
• Metaheuristic algorithms for combinatorial optimization problems. (Abstract of thesis)
• Models and algorithms for combinatorial optimization problems arising in railway applications

Cites work

• A time bucket formulation for the traveling salesman problem with time windows
• An ILP improvement procedure for the open vehicle routing problem
• An integer linear programming local search for capacitated vehicle routing problems
• Disjunctive Programming
• Experiments with two row tableau cuts
• Lift-and-project for mixed 0-1 programming: recent progress
• On the separation of disjunctive cuts

Cited in

(8)

• Enhancing CP-based column generation for integer programs
• Polyhedral approximation in mixed-integer convex optimization
• A time bucket formulation for the traveling salesman problem with time windows
• Mixed integer programming-based liveness test for FMS with full routing flexibility
• Integer linear programming models for global routing
• Integrating local search techniques into mixed integer programming. (Thesis)
• Transferring information across restarts in MIP
• Metaheuristic algorithms for combinatorial optimization problems. (Abstract of thesis)

Describes a project that uses

Uses Software

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657574)