New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm
From MaRDI portal
Publication:2176276
DOI10.1007/S10898-020-00874-3zbMATH Open1442.90151OpenAlexW3004045780MaRDI QIDQ2176276FDOQ2176276
Authors: Remigijus Paulavičius, Claire S. Adjiman 
Publication date: 4 May 2020
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00874-3
Recommendations
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- Global solution of bilevel programs with a nonconvex inner program
- Global solution of nonlinear mixed-integer bilevel programs
- Global optimization of nonlinear bilevel programming problems
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- A Computational Study of Search Strategies for Mixed Integer Programming
- Practical bilevel optimization. Algorithms and applications
- Bilevel and multilevel programming: A bibliography review
- Foundations of bilevel programming
- A new approach for solving linear bilevel problems using genetic algorithms
- An overview of bilevel optimization
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Global solution of bilevel programs with a nonconvex inner program
- A polyhedral branch-and-cut approach to global optimization
- On generalized semi-infinite optimization and bilevel optimization
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- Bilevel programming problems. Theory, algorithms and applications to energy networks
- Mathematical Programs with Optimization Problems in the Constraints
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- Title not available (Why is that?)
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- The Mixed Integer Linear Bilevel Programming Problem
- Solving nonlinear principal-agent problems using bilevel programming
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Title not available (Why is that?)
- A nonconvex max-min problem
- Solving generalized semi-infinite programs by reduction to simpler problems
- Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
- Simplicial global optimization
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- Evolutionary algorithm for bilevel optimization using approximations of the lower level optimal solution mapping
- The bilevel linear/linear fractional programming problem
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
- Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences
- A study on the use of heuristics to solve a bilevel programming problem
Cited In (7)
- Global solution of bilevel programs with a nonconvex inner program
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- A survey on mixed-integer programming techniques in bilevel optimization
- A new node selection strategy in the branch-and-bound procedure
- On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level
- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities
- Title not available (Why is that?)
Uses Software
This page was built for publication: New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176276)
