Methods of Nonlinear 0-1 Programming
From MaRDI portal
Cited in
(64)- A linear mixed-integer model for a purchasing problem involving discount structures
- 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 new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
- 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
- On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- Lagrangean decomposition for integer nonlinear programming with linear constraints
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Linear programming for the \(0-1\) quadratic knapsack problem
- Lagrangean methods for the 0-1 quadratic knapsack problem
- Ranking in quadratic integer programming problems
- QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Lower bounds for the quadratic semi-assignment problem
- Fractional 0-1 programming: applications and algorithms
- Lagrangean methods for 0-1 quadratic problems
- 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
- Uniqueness in quadratic and hyperbolic \(0-1\) programming problems
- Discrete optimization by optimal control methods. I: Separable problems
- A new approach for modeling and solving set packing problems
- Lower bound improvement and forcing rule for quadratic binary programming
- 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
- Mixed integer linear programming formulation techniques
- Nonlinear 0–1 programming: I. Linearization techniques
- Fractional covers for forests and matchings
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- Reformulations in Mathematical Programming: Definitions and Systematics
- Roof duality, complementation and persistency in quadratic 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∗
- Approximation algorithms for discrete polynomial optimization
- The unconstrained binary quadratic programming problem: a survey
- Models for machine-part grouping in cellular manufacturing
- A theory of even functionals and their algorithmic applications
- Testing optimality for quadratic 0?1 unconstrained problems
- Tight cycle relaxations for the cut polytope
- A revised Taha's algorithm for polynomial 0-1 programming
- Clique Partitioning for Clustering: A Comparison withK-Means and Latent Class Analysis
- An improved enumerative algorithm for solving quadratic zero-one programming
- A theory of even functionals and their algorithmic applications
- Concave extensions for nonlinear 0-1 maximization problems
- Pseudo-Boolean optimization
- A new linearization technique for multi-quadratic 0-1 programming problems.
- A preprocessing technique for quadratic unconstrained binary optimization
- On duality for Boolean programming
- Algorithms for the maximum satisfiability problem
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
- Recent trends in combinatorial optimization
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Solving group technology problems via clique partitioning
- Upper-bounds for quadratic 0-1 maximization
- 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)
- A discrete dynamic convexized method for nonlinear integer programming
- Optimal cuts in graphs and statistical mechanics
This page was built for publication: Methods of Nonlinear 0-1 Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3863696)
