An Implicit Enumeration Algorithm for Quadratic Integer Programming
From MaRDI portal
Publication:3887228
DOI10.1287/mnsc.26.3.282zbMath0443.90067OpenAlexW2037033044MaRDI QIDQ3887228
Jonathan S. Yormark, Richard D. McBride
Publication date: 1980
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.26.3.282
quadratic integer programmingimplicit enumeration methodLemke's complementary pivot methodnonlinear extensionguide branchingimplicit upper boundingparametric penaltiespseudo-costs
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Boolean programming (90C09)
Related Items
Abandonment value in capital budeting: A mathematical programming approach, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, A quadratic integer program for the location of interacting hub facilities, Approximating finite weighted point sets by hyperplanes, Graph separation techniques for quadratic zero-one programming, Computational aspects of a branch and bound algorithm for quadratic zero- one programming, An algorithm for indefinite integer quadratic programming, Probabilistic GRASP-tabu search algorithms for the UBQP problem, Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem, Structured linear reformulation of binary quadratically constrained quadratic programs, Diversification-driven tabu search for unconstrained binary quadratic problems, A hybrid metaheuristic approach to solving the UBQP problem, Ellipsoid Bounds for Convex Quadratic Integer Programming, An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach, Two-stage quadratic integer programs with stochastic right-hand sides, CON due-date determination and sequencing, Zur effektiven Lösung von booleschen, quadratischen Optimierungsproblemen, The spherical constraint in Boolean quadratic programs, A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm1, Models and methods of solution of quadratic integer programming problems, Optimization methods for mixed integer weakly concave programming problems, Reformulating nonlinear combinatorial optimization problems for higher computational efficiency, Optimal design of a distributed network with a two-level hierarchical structure, Path relinking for unconstrained binary quadratic programming, Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem, Parametric Lagrangian dual for the binary quadratic programming problem, Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming, An exact penalty function approach for nonlinear integer programming problems, The indefinite zero-one quadratic problem, Lower bound improvement and forcing rule for quadratic binary programming, An evolutionary heuristic for quadratic 0-1 programming, On duality for Boolean programming, Lagrangean decompositions for the unconstrained binary quadratic programming problem, Integer quadratic optimization, Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method, Ranking in quadratic integer programming problems, Simulated annealing for the unconstrained quadratic pseudo-Boolean function, Mixed-integer quadratic programming, One-pass heuristics for large-scale unconstrained binary quadratic problems, An unconstrained quadratic binary programming approach to the vertex coloring problem
Uses Software
