Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
From MaRDI portal
Publication:5677289
DOI10.1287/opre.21.1.156zbMath0261.90045OpenAlexW2051986176WikidataQ60395658 ScholiaQ60395658MaRDI QIDQ5677289
Publication date: 1973
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.21.1.156
Related Items
Polynomial transformations and data-independent neighborhood functions, A branch and bound algorithm for solving separable convex integer programming problems, Matroid optimisation problems with nested non-linear monomials in the objective function, An algorithm for indefinite integer quadratic programming, Integrated design of cellular manufacturing systems in the presence of alternative process plans, Structured linear reformulation of binary quadratically constrained quadratic programs, Inductive linearization for binary quadratic programs with linear constraints, Ellipsoid Bounds for Convex Quadratic Integer Programming, An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach, On linearization techniques for budget-constrained binary quadratic programming problems, Global solution of nonlinear mixed-integer bilevel programs, Modeling and integer programming techniques applied to propositional calculus, Multiple objective decision making approach to cell formation: A goal programming model, Compact linearization for binary quadratic problems subject to assignment constraints, An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines, Reduction of nonlinear integer separable programming problems∗, An improved linearization strategy for zero-one quadratic programming problems, Reformulating nonlinear combinatorial optimization problems for higher computational efficiency, Berge-acyclic multilinear 0-1 optimization problems, A class of valid inequalities for multilinear 0-1 optimization problems, Mixed-integer bilinear programming problems, An improved linearization technique for a class of quadratic 0-1 programming problems, Pseudo-Boolean optimization, A new linearization technique for multi-quadratic 0-1 programming problems., The indefinite zero-one quadratic problem, An algorithm for the quadratic assignment problem using Benders' decomposition, Theoretical and computational study of several linearisation techniques for binary quadratic problems, On the Quadratic Programming Approach for Hub Location Problems, Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method, Matroid optimization problems with monotone monomials in the objective, Mixed-integer quadratic programming, On cell size and machine requirements planning in group technology systems, Configuration of manufacturing software through capability specification and selection, Univariate parameterization for global optimization of mixed-integer polynomial problems, A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
