Facility location and pricing problem: discretized mill price and exact algorithms
From MaRDI portal
Cites work
- A bilevel competitive location and pricing model with nonuniform split of demand
- A double VNS heuristic for the facility location and pricing problem
- A profit-maximization location-routing-pricing problem: a branch-and-price algorithm
- An efficient optimization procedure for designing a capacitated distribution network with price-sensitive demand
- Bi-objective vibration damping optimization for congested location-pricing problem
- Bilevel competitive facility location and pricing problems
- Closest assignment constraints in discrete location problems
- Competitive location and pricing on a line with metric transportation costs
- Competitive location and pricing on networks with random utilities
- Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
- Discrete linear bilevel programming problem
- Joint location and pricing within a user-optimized environment
- Location equilibria for a continuous competitive facility location problem under delivered pricing
- Location, pricing and the problem of Apollonius
- Optimal location with equitable loads
- Optimizing pricing and location decisions for competitive service facilities charging uniform price
- Retail store location and pricing within a competitive environment using constrained multinomial logit
- Simple plant location under uniform delivered pricing
- Single facility location on a network under mill and delivered pricing
- The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches
- Uncapacitated Plant Location Under Alternative Spatial Price Policies
Cited in
(2)
This page was built for publication: Facility location and pricing problem: discretized mill price and exact algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6167526)
