A mixed-integer model for solving ordering problems with side constraints

DOI10.1023/A:1018989130169zbMath0880.90078OpenAlexW1500637020MaRDI QIDQ1357786

Francesco Maffioli, Anna Sciomachen

Publication date: 5 February 1998

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018989130169

zbMATH Keywords

time windowsequential ordering problemprecedence relationshipslinear mixed integer program

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items (11)

A branch-and-cut framework for the consistent traveling salesman problem ⋮ Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand ⋮ Clustered coverage orienteering problem of unmanned surface vehicles for water sampling ⋮ The Combined Vehicle Routing and Foldable Container Scheduling Problem: A Model Formulation and Tabu Search Based Solution Approaches ⋮ Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies ⋮ Mixed-integer programming approaches for the time-constrained maximal covering routing problem ⋮ Solving a school bus scheduling problem with integer programming ⋮ Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics ⋮ Models and algorithms for the traveling salesman problem with time-dependent service times ⋮ Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments ⋮ Projection results for vehicle routing

This page was built for publication: A mixed-integer model for solving ordering problems with side constraints