Mixed-integer quadratic programming
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3115465 (Why is no real title available?)
- scientific article; zbMATH DE number 3477343 (Why is no real title available?)
- scientific article; zbMATH DE number 3211372 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- scientific article; zbMATH DE number 3410784 (Why is no real title available?)
- scientific article; zbMATH DE number 3111121 (Why is no real title available?)
- A method of solution for quadratic programs
- A pseudo primal-dual integer programming algorithm
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- Duality in Discrete Programming: II. The Quadratic Case
- Duality in quadratic programming
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- Generalized Benders decomposition
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey
- Multicommodity Distribution System Design by Benders Decomposition
- Partitioning procedures for solving mixed-variables programming problems
- Simultaneous Investment and Allocation Decisions Applied to Water Planning
- Symmetric dual quadratic programs
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- The Simplex Method for Quadratic Programming
Cited in
(22)- Improved algorithm for mixed-integer quadratic programs and a computational study
- An efficient active-set method with applications to sparse approximations and risk minimization
- Computing equilibria of Cournot oligopoly models with mixed-integer quantities
- Decomposition in general mathematical programming
- A note on Benders' decomposition in mixed-integer quadratic programming
- Mixed-integer bilinear programming problems
- A hybrid approach to resolving a differentiable integer program.
- Introduction to QUBO
- Lagrangean decomposition for integer nonlinear programming with linear constraints
- An algorithm for indefinite integer quadratic programming
- Two-stage quadratic integer programs with stochastic right-hand sides
- A new local and global optimization method for mixed integer quadratic programming problems
- Spatial interaction models with individual-level data for explaining labor flows and developing local labor markets
- Integer quadratic optimization
- A feasible active set method with reoptimization for convex quadratic mixed-integer programming
- Nonconvex SVM for cancer diagnosis based on morphologic features of tumor microenvironment
- A portfolio theory approach to crop planning under environmental constraints
- Dorn's duality for quadratic programs revisited: The nonconvex case
- Models and methods of solution of quadratic integer programming problems
- Global hybrid modeling and control of a buck converter: a novel concept
- Solving a nonlinear integer program for allocating resources
- A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm1
This page was built for publication: Mixed-integer quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3931023)
