A branch-and-cut algorithm for mixed-integer bilinear programming
From MaRDI portal
Publication:2282539
DOI10.1016/j.ejor.2019.09.043zbMath1430.90431OpenAlexW2975229626WikidataQ127201335 ScholiaQ127201335MaRDI QIDQ2282539
Michele Monaci, Matteo Fischetti
Publication date: 8 January 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11585/763560
combinatorial optimizationbilinear programmingintersection cutsbranch-and-cut algorithmsmixed-integer quadratic programming
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20)
Related Items
Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT, Maximal Quadratic-Free Sets, Cutting Plane Generation through Sparse Principal Component Analysis, On pricing-based equilibrium for network expansion planning. A multi-period bilevel approach under uncertainty, Topology optimization of adaptive structures: new limits of material economy, On the implementation and strengthening of intersection cuts for QCQPs, On the implementation and strengthening of intersection cuts for QCQPs, Maximal quadratic-free sets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Branching on nonchimerical fractionalities
- Relaxations and discretizations for the pooling problem
- Mixed-integer bilinear programming problems
- A new reformulation-linearization technique for bilinear programming problems
- Improved convexity cuts for lattice point problems
- Generalized bilinear programming: An application in farm management
- BARON: A general purpose global optimization software package
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Information-based branching schemes for binary linear mixed integer problems
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- Solving Mixed Integer Bilinear Problems Using MILP Formulations
- Valid Inequalities for the Pooling Problem with Binary Variables
- Pooling Problem: Alternate Formulations and Solution Methods
- Branching and bounds tighteningtechniques for non-convex MINLP
- Analysis of MILP Techniques for the Pooling Problem
- Bidimensional Packing by Bilinear Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A bilinear approach to the pooling problem†
- On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Polyhedral convexity cuts and negative edge extensions
- Computational study of a family of mixed-integer quadratic programming problems
- Exploiting Erraticism in Search
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Benchmarking optimization software with performance profiles.
