Methods of Nonlinear 0-1 Programming
From MaRDI portal
Publication:3863696
DOI10.1016/S0167-5060(08)70343-1zbMath0426.90063OpenAlexW1513772636MaRDI QIDQ3863696
Publication date: 1979
Published in: Discrete Optimization II, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium co-sponsored by IBM Canada and SIAM Banff, Aha. and Vancouver (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70343-1
surveylinearizationapplicationsnetwork flowsalgebraic methodsenumerative algorithmsnonlinear 0-1 programmingreduction to equivalent forms
Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30) Boolean programming (90C09)
Related Items
Deterministic methods in constrained global optimization: Some recent advances and new fields of application, A solvable case of quadratic 0-1 programming, Penalty formulation for zero-one nonlinear programming, A quadratic integer program for the location of interacting hub facilities, A relaxation method for nonconvex quadratically constrained quadratic programs, A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope, A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming, Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations, Graph separation techniques for quadratic zero-one programming, On the equivalence between some discrete and continuous optimization problems, Computational aspects of a branch and bound algorithm for quadratic zero- one programming, A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems, An improved enumerative algorithm for solving quadratic zero-one programming, Recognition problems for special classes of polynomials in 0-1 variables, The Boolean quadratic polytope: Some characteristics, facets and relatives, A hybrid method for solving nonlinear knapsack problems, Solving group technology problems via clique partitioning, Fractional 0-1 programming: applications and algorithms, Nonlinear 0–1 programming: I. Linearization techniques, Approximation algorithms for discrete polynomial optimization, Lower bounds for the quadratic semi-assignment problem, The unconstrained binary quadratic programming problem: a survey, Testing optimality for quadratic 0?1 unconstrained problems, Upper-bounds for quadratic 0-1 maximization, Uniqueness in quadratic and hyperbolic \(0-1\) programming problems, On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization, A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm1, Reduction of nonlinear integer separable programming problems∗, The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds, Discrete optimization by optimal control methods. I: Separable problems, Lagrangean decomposition for integer nonlinear programming with linear constraints, A new approach for modeling and solving set packing problems, A theory of even functionals and their algorithmic applications, Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method, A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO), Fractional covers for forests and matchings, A discrete dynamic convexized method for nonlinear integer programming, Complexity of uniqueness and local search in quadratic 0-1 programming, Concave extensions for nonlinear 0-1 maximization problems, Pseudo-Boolean optimization, Optimal cuts in graphs and statistical mechanics, A new linearization technique for multi-quadratic 0-1 programming problems., A revised Taha's algorithm for polynomial 0-1 programming, Lower bound improvement and forcing rule for quadratic binary programming, Clique Partitioning for Clustering: A Comparison withK-Means and Latent Class Analysis, Reformulations in Mathematical Programming: Definitions and Systematics, Mixed Integer Linear Programming Formulation Techniques, Lagrangean methods for 0-1 quadratic problems, On duality for Boolean programming, Linear programming for the \(0-1\) quadratic knapsack problem, Lagrangean methods for the 0-1 quadratic knapsack problem, Algorithms for the maximum satisfiability problem, Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture, Ranking in quadratic integer programming problems, QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm, Recent trends in combinatorial optimization, A linear mixed-integer model for a purchasing problem involving discount structures, Models for machine-part grouping in cellular manufacturing, Tight Cycle Relaxations for the Cut Polytope, A theory of even functionals and their algorithmic applications, An improved branch and bound algorithm for mixed integer nonlinear programs, Roof duality, complementation and persistency in quadratic 0–1 optimization, An unconstrained quadratic binary programming approach to the vertex coloring problem
