A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints
From MaRDI portal
Publication:2629907
Recommendations
- Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences
- On single-source capacitated facility location with cost and fairness objectives
- Exact method for the capacitated competitive facility location problem
- scientific article; zbMATH DE number 6006831
- New models for the location of controversial facilities: a bilevel programming approach
Cites work
- scientific article; zbMATH DE number 4202014 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 821272 (Why is no real title available?)
- A Benders decomposition method for discretely-constrained mathematical programs with equilibrium constraints
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- A Dual-Based Procedure for Stochastic Facility Location
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- A bilevel mixed-integer program for critical infrastructure protection planning
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
- An Improved Algorithm for the Capacitated Facility Location Problem
- An exact solution approach for the interdiction median problem with fortification
- Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach
- Descent approaches for quadratic bilevel programming
- Discrete linear bilevel programming problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Foundations of bilevel programming
- Multicommodity Distribution System Design by Benders Decomposition
- Network flows. Theory, algorithms, and applications.
- New Branch-and-Bound Rules for Linear Bilevel Programming
- On a bi-level formulation to protect uncapacitated \(p\)-median systems with facility recovery time and frequent disruptions
- Optimizing system resilience: a facility protection model with recovery time
- Partitioning procedures for solving mixed-variables programming problems
- Practical bilevel optimization. Algorithms and applications
- Reducibility among combinatorial problems
- Resolution method for mixed integer bi-level linear problems based on decomposition technique
- Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm
- The polynomial hierarchy and a simple model for competitive analysis
- The simple plant location problem: Survey and synthesis
- Uncapacitated and capacitated facility location problems
Cited in
(10)- Novel bilevel formulations for waste management
- Models, algorithms and applications for location problems
- Location of differentiated waste collection centers with user cooperation: a bilevel optimization approach
- New models for the location of controversial facilities: a bilevel programming approach
- Maximizing recyclable materials and user utility in waste collection: a linear-quadratic bilevel optimization approach
- An enhanced branch-and-bound algorithm for bilevel integer linear programming
- The multilevel facility location and pricing problems: the computational complexity and the stability analysis
- A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach
This page was built for publication: A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629907)
