Pages that link to "Item:Q4602475"

The following pages link to A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs (Q4602475):

Displaying 50 items.

• A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs (Q670656) (← links)
• Minimum cost edge blocker clique problem (Q827246) (← links)
• Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
• The maximum clique interdiction problem (Q1735171) (← links)
• A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
• A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem (Q2029945) (← links)
• The impact of neighboring markets on renewable locations, transmission expansion, and generation investment (Q2030627) (← links)
• An enhanced branch-and-bound algorithm for bilevel integer linear programming (Q2030724) (← links)
• A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072) (← links)
• Closing the gap in linear bilevel optimization: a new valid primal-dual inequality (Q2039060) (← links)
• The trouble with the second quantifier (Q2044549) (← links)
• Outer approximation for global optimization of mixed-integer quadratic bilevel problems (Q2044965) (← links)
• The cost of decoupling trade and transport in the European entry-exit gas market with linear physics modeling (Q2060426) (← links)
• The continuous maximum capacity path interdiction problem (Q2083925) (← links)
• An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities (Q2089867) (← links)
• On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints (Q2089868) (← links)
• A framework for generalized Benders' decomposition and its application to multilevel optimization (Q2097644) (← links)
• Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy (Q2116889) (← links)
• On a generalization of the Chvátal-Gomory closure (Q2118122) (← links)
• The probabilistic travelling salesman problem with crowdsourcing (Q2146980) (← links)
• SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs (Q2164703) (← links)
• New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm (Q2176276) (← links)
• Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
• An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299) (← links)
• Mixed-integer bilevel representability (Q2220657) (← links)
• A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation (Q2220913) (← links)
• Complexity of near-optimal robust versions of multilevel optimization problems (Q2230787) (← links)
• Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks (Q2242189) (← links)
• Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities (Q2245701) (← links)
• A branch-and-cut algorithm for mixed-integer bilinear programming (Q2282539) (← links)
• An exact algorithm for solving the bilevel facility interdiction and fortification problem (Q2294241) (← links)
• Resilient layout, design and operation of energy-efficient water distribution networks for high-rise buildings using MINLP (Q2331363) (← links)
• A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences (Q2664416) (← links)
• Multi-stage optimal design of road networks for automated vehicles with elastic multi-class demand (Q2669582) (← links)
• The leader multipurpose shopping location problem (Q2672066) (← links)
• Multilevel Approaches for the Critical Node Problem (Q4994170) (← 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)
• Core Pricing in Combinatorial Exchanges with Financially Constrained Buyers: Computational Hardness and Algorithmic Solutions (Q5031010) (← links)
• A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← links)
• A Catalog of Formulations for the Network Pricing Problem (Q5058007) (← links)
• Managing Product Transitions: A Bilevel Programming Approach (Q5058022) (← links)
• Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments (Q5058394) (← links)
• Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets (Q5084616) (← links)
• Bilevel Integer Programs with Stochastic Right-Hand Sides (Q5084620) (← links)
• A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997) (← links)
• Benders Subproblem Decomposition for Bilevel Problems with Convex Follower (Q5087737) (← links)
• Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem (Q5106375) (← links)