A profit-maximization location-routing-pricing problem: a branch-and-price algorithm
DOI10.1016/J.EJOR.2018.02.020zbMath1403.90072OpenAlexW2794096162MaRDI QIDQ1653368
Elahe Amiri, Mahla Meskar, Amir Ahmadi-Javid
Publication date: 3 August 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.02.020
mixed-integer linear programming (MILP)branch-and-price and column generationlocation-routing problems (LRP)price-sensitive demands and delivered pricingvehicle routing problems with profit (VRPP)
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of recent research on location-routing problems
- Orienteering problem: a survey of recent variants, solution approaches and applications
- Incorporating location, inventory and price decisions into a supply chain distribution network design problem
- Solving the team orienteering problem with cutting planes
- The orienteering problem: a survey
- Competitive location on networks under delivered pricing
- Location-routing: issues, models and methods
- Heuristic and lower bound for a stochastic location-routing problem
- A discrete long-term location--price problem under the assumption of discriminatory pricing: formulations and parametric analysis
- The effect of ignoring routes when locating depots
- A reoptimization algorithm for the shortest path problem with time windows
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
- Simple plant location under uniform delivered pricing
- The many-to-many location-routing problem
- Combined location-routing problems: A synthesis and future research directions
- Location, pricing and the problem of Apollonius
- The undirected capacitated general routing problem with profits
- Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
- On price competition in location-price models with spatially separated makets
- Minmax \(p\)-traveling salesmen location problems on a tree
- Optimal solutions for routing problems with profits
- An efficient optimization procedure for designing a capacitated distribution network with price-sensitive demand
- The multi-vehicle profitable pickup and delivery problem
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- A survey of variants and extensions of the location-routing problem
- A survey of resource constrained shortest path problems: Exact solution approaches
- A taxonomical analysis, current methods and objectives on location-routing problems
- Vehicle Routing
- The capacitated team orienteering and profitable tour problems
- Decomposition Principle for Linear Programs
- Integer Programming Formulation of Traveling Salesman Problems
- Uncapacitated Plant Location Under Alternative Spatial Price Policies
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- Observations on the Shape and Relevance of the Spatial Demand Function
- The Traveling Repairperson Home Base Location Problem
- Probabilistic a priori routing-location problems
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Shortest Path Problems with Resource Constraints
- Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree
This page was built for publication: A profit-maximization location-routing-pricing problem: a branch-and-price algorithm
