Pages that link to "Item:Q5917900"
From MaRDI portal
The following pages link to Bilevel programming and price setting problems (Q5917900):
Displayed 35 items.
- An extended network interdiction problem for optimal toll control (Q325471) (← links)
- A branch-and-cut-and-price algorithm for the Stackelberg minimum spanning tree game (Q325472) (← links)
- A Stackelberg game-theoretic approach to optimal real-time pricing for the smart grid (Q889997) (← links)
- Solving discrete linear bilevel optimization problems using the optimal value reformulation (Q1675551) (← links)
- Integer programming formulations for three sequential discrete competitive location problems with foresight (Q1681140) (← links)
- A novel approach based on preference-based index for interval bilevel linear programming problem (Q1689673) (← links)
- Global optimality test for maximin solution of bilevel linear programming with ambiguous lower-level objective function (Q1699146) (← links)
- An approach for solving a fuzzy bilevel programming problem through nearest interval approximation approach and KKT optimality conditions (Q1701986) (← links)
- The rank pricing problem: models and branch-and-cut algorithms (Q1722958) (← links)
- Real-time pricing decision making for retailer-wholesaler in smart grid based on game theory (Q1724781) (← links)
- Surveys in operations research (Q1730527) (← links)
- Radio communications interdiction problem under deterministic and probabilistic jamming (Q1738838) (← links)
- The graph segmentation problem (Q1742196) (← links)
- The envy-free pricing problem, unit-demand markets and connections with the network pricing problem (Q1751179) (← links)
- Solving the fully fuzzy bilevel linear programming problem through deviation degree measures and a ranking function method (Q1793492) (← links)
- Road network pricing and design for ordinary and hazmat vehicles: integrated model and specialized local search (Q2003575) (← links)
- On the Stackelberg knapsack game (Q2029942) (← links)
- Closing the gap in linear bilevel optimization: a new valid primal-dual inequality (Q2039060) (← links)
- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities (Q2089867) (← links)
- An iterative two-stage heuristic algorithm for a bilevel service network design and pricing model (Q2116857) (← links)
- The hub location and pricing problem (Q2140288) (← links)
- A decomposition method for MINLPs with Lipschitz continuous nonlinearities (Q2330657) (← links)
- A Stackelberg knapsack game with weight control (Q2333816) (← links)
- Twelve surveys in operations research (Q2630815) (← links)
- Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method (Q4995065) (← links)
- A Unified Framework for Multistage Mixed Integer Linear Optimization (Q5014640) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
- Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization (Q5144791) (← links)
- Pricing Toll Roads under Uncertainty (Q5240222) (← links)
- Bilevel programming and price setting problems (Q5925163) (← links)
- On the complexity of the bilevel minimum spanning tree problem (Q6064168) (← links)
- Metaheuristics for bilevel optimization: a comprehensive review (Q6065604) (← links)
- Computational comparisons of different formulations for the Stackelberg minimum spanning tree game (Q6070408) (← links)
- Coordinating harvest planning and scheduling in an agricultural supply chain through a stochastic bilevel programming (Q6079930) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)