Combinatorial Benders Cuts for the Minimum Tollbooth Problem
From MaRDI portal
Publication:3100444
DOI10.1287/opre.1090.0694zbMath1226.90122OpenAlexW1982862187MaRDI QIDQ3100444
Publication date: 24 November 2011
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1090.0694
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)
Related Items (16)
Learning Optimized Risk Scores ⋮ A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty ⋮ New Complexity Results and Algorithms for the Minimum Tollbooth Problem ⋮ Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures ⋮ A combinatorial Benders' decomposition for the lock scheduling problem ⋮ The Star Degree Centrality Problem: A Decomposition Approach ⋮ The multi-period multi-trip container drayage problem with release and due dates ⋮ A heuristic method for the minimum toll booth problem ⋮ On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization ⋮ Matheuristics: survey and synthesis ⋮ Unnamed Item ⋮ The minimum tollbooth problem in atomic network congestion games with unsplittable flows ⋮ Benders decomposition: solving binary master problems by enumeration ⋮ The multiple multidimensional knapsack with family-split penalties ⋮ Capacitated multi-period maximal covering location problem with server uncertainty ⋮ Buffer allocation in stochastic flow lines via sample-based optimization with initial bounds
This page was built for publication: Combinatorial Benders Cuts for the Minimum Tollbooth Problem
