Pages that link to "Item:Q3863696"
From MaRDI portal
The following pages link to Methods of Nonlinear 0-1 Programming (Q3863696):
Displaying 50 items.
- Approximation algorithms for discrete polynomial optimization (Q384206) (← links)
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- An improved enumerative algorithm for solving quadratic zero-one programming (Q594766) (← links)
- A theory of even functionals and their algorithmic applications (Q672856) (← links)
- Concave extensions for nonlinear 0-1 maximization problems (Q689146) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- A new linearization technique for multi-quadratic 0-1 programming problems. (Q703274) (← links)
- On duality for Boolean programming (Q750292) (← links)
- Algorithms for the maximum satisfiability problem (Q753502) (← links)
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture (Q757239) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- Solving group technology problems via clique partitioning (Q877223) (← links)
- Upper-bounds for quadratic 0-1 maximization (Q913658) (← links)
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
- A discrete dynamic convexized method for nonlinear integer programming (Q953398) (← links)
- Optimal cuts in graphs and statistical mechanics (Q967941) (← links)
- A linear mixed-integer model for a purchasing problem involving discount structures (Q1056678) (← links)
- A solvable case of quadratic 0-1 programming (Q1079494) (← links)
- Penalty formulation for zero-one nonlinear programming (Q1091262) (← links)
- A quadratic integer program for the location of interacting hub facilities (Q1092794) (← links)
- A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems (Q1110993) (← links)
- Recognition problems for special classes of polynomials in 0-1 variables (Q1121786) (← links)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- A hybrid method for solving nonlinear knapsack problems (Q1123129) (← links)
- On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization (Q1174434) (← links)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
- Lagrangean decomposition for integer nonlinear programming with linear constraints (Q1181738) (← links)
- Complexity of uniqueness and local search in quadratic 0-1 programming (Q1197889) (← links)
- Linear programming for the \(0-1\) quadratic knapsack problem (Q1268263) (← links)
- Lagrangean methods for the 0-1 quadratic knapsack problem (Q1268265) (← links)
- Ranking in quadratic integer programming problems (Q1278381) (← links)
- QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm (Q1278400) (← links)
- An improved branch and bound algorithm for mixed integer nonlinear programs (Q1318452) (← links)
- Lower bounds for the quadratic semi-assignment problem (Q1388830) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- Lagrangean methods for 0-1 quadratic problems (Q1803678) (← links)
- A relaxation method for nonconvex quadratically constrained quadratic programs (Q1892602) (← links)
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope (Q1892658) (← links)
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming (Q1893147) (← links)
- Uniqueness in quadratic and hyperbolic \(0-1\) programming problems (Q2450746) (← links)
- Discrete optimization by optimal control methods. I: Separable problems (Q2457533) (← links)
- A new approach for modeling and solving set packing problems (Q2462145) (← links)
- Lower bound improvement and forcing rule for quadratic binary programming (Q2506180) (← links)
- Graph separation techniques for quadratic zero-one programming (Q2638933) (← links)
- On the equivalence between some discrete and continuous optimization problems (Q2640444) (← links)
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming (Q2641083) (← links)
- Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
