Box-constrained quadratic programs with fixed charge variables
From MaRDI portal
Publication:933786
DOI10.1007/s10898-007-9167-8zbMath1176.90426OpenAlexW2042916461MaRDI QIDQ933786
Dieter Vandenbussche, Tin-Chi Lin
Publication date: 25 July 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-007-9167-8
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20)
Related Items
A note on sufficient global optimality conditions for fixed charge quadratic programs, Lifting inequalities: a framework for generating strong cuts for nonlinear programs, Global optimality conditions for fixed charge quadratic programs, Box-constrained quadratic programs with fixed charge variables
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
- Box-constrained quadratic programs with fixed charge variables
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Capacitated facility location: Separation algorithms and computational experience
- A finite algorithm for solving general quadratic problems
- MINTO, a Mixed INTeger Optimizer
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Seizure warning algorithm based on optimization and nonlinear dynamics
- A polyhedral study of nonconvex quadratic programs with box constraints
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- BARON: A general purpose global optimization software package
- Lower bound improvement and forcing rule for quadratic binary programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Solving Large-Scale Zero-One Linear Programming Problems
- Valid Linear Inequalities for Fixed Charge Problems
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Facets of the Complementarity Knapsack Polytope
- Dual bounds and optimality cuts for all-quadratic programs with convex constraints
- Flow pack facets of the single node fixed-charge flow polytope
