Pages that link to "Item:Q3216430"

The following pages link to Nonlinear 0–1 programming: I. Linearization techniques (Q3216430):

Displaying 33 items.

• Concave extensions for nonlinear 0-1 maximization problems (Q689146) (← links)
• \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation (Q730482) (← links)
• Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
• ``Miniaturized'' linearizations for quadratic 0/1 problems (Q817208) (← links)
• Polyhedral analysis for concentrator location problems (Q853560) (← 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)
• Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
• The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
• Experiments in quadratic 0-1 programming (Q1123806) (← 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)
• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique (Q1187374) (← links)
• A survey of algorithms for the generalized assignment problem (Q1199507) (← links)
• Combinatorial optimization models for production scheduling in automated manufacturing systems (Q1278813) (← links)
• An enumerative algorithm framework for a class of nonlinear integer programming problems (Q1278943) (← links)
• A constrained nonlinear 0-1 program for data allocation (Q1290718) (← links)
• Strong valid inequalities for Boolean logical pattern generation (Q1675646) (← links)
• Compact linearization for binary quadratic problems subject to assignment constraints (Q1728408) (← links)
• Two new reformulation convexification based hierarchies for 0-1 MIPs (Q1748458) (← links)
• Robust metaheuristic algorithm for redundancy optimization in large-scale complex systems (Q1772975) (← links)
• A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope (Q1892658) (← links)
• Explicit convex and concave envelopes through polyhedral subdivisions (Q1949256) (← links)
• Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
• Graph, clique and facet of Boolean logical polytope (Q2124813) (← links)
• A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation (Q2274853) (← links)
• The basic algorithm for pseudo-Boolean programming revisited (Q2277139) (← links)
• Continuous dynamical systems that realize discrete optimization on the hypercube (Q2503628) (← links)
• An algorithm for indefinite integer quadratic programming (Q2641219) (← links)
• Nonlinear 0–1 programming: II. Dominance relations and algorithms (Q3216431) (← links)
• Roof duality for polynomial 0–1 optimization (Q3770279) (← links)
• A revised Taha's algorithm for polynomial 0-1 programming (Q5426969) (← links)
• A branch and bound algorithm for designing reliable systems at a minimum cost (Q5931708) (← links)