Pages that link to "Item:Q4202578"
From MaRDI portal
The following pages link to State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming (Q4202578):
Displaying 40 items.
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
- Quadratic reformulations of nonlinear binary optimization problems (Q517297) (← links)
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
- Combinatorial structure and randomized subexponential algorithms for infinite games (Q817809) (← links)
- Solving group technology problems via clique partitioning (Q877223) (← links)
- Quadratic convex reformulations for quadratic 0-1 programming (Q941006) (← 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)
- MILP approach to pattern generation in logical analysis of data (Q1028471) (← links)
- Nonlinear integer programming algorithms: A survey (Q1082264) (← links)
- A single-branch implicit enumeration algorithm for zero-one programs with geometrical constraints (Q1085782) (← links)
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique (Q1187374) (← links)
- Unconstrained 0-1 nonlinear programming: A nondifferentiable approach (Q1187840) (← links)
- A Monte-Carlo approach for 0-1 programming problems (Q1195974) (← links)
- An approximate method for local optima for nonlinear mixed integer programming problems (Q1200840) (← links)
- A constrained nonlinear 0-1 program for data allocation (Q1290718) (← links)
- Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem (Q1296804) (← links)
- An ordering (enumerative) algorithm for nonlinear \(0-1\) programming (Q1338536) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- Heuristics for cardinality constrained portfolio optimization (Q1582684) (← links)
- A Boolean penalty method for zero-one nonlinear programming (Q1583688) (← links)
- Probabilistic satisfiability with imprecise probabilities (Q1605686) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- A class of valid inequalities for multilinear 0-1 optimization problems (Q1751230) (← links)
- Minimization of ordered, symmetric half-products (Q1763481) (← 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)
- Best second order bounds for two-terminal network reliability with dependent edge failures (Q1961463) (← links)
- Merging the local and global approaches to probabilistic satisfiability (Q2270380) (← links)
- Compact quadratizations for pseudo-Boolean functions (Q2307493) (← links)
- Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
- Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302) (← links)
- Using \(xQx\) to model and solve the uncapacitated task allocation problem (Q2488221) (← links)
- Nonlinear one-parametric bottleneck linear programming (Q3693286) (← links)
- An improved enumeration for pure 0-1 programs (Q3978584) (← links)
- Applications and Computational Advances for Solving the QUBO Model (Q5050142) (← links)
- Mass Customization and “Forecasting Options’ Penetration Rates Problem” (Q5129183) (← links)
- A revised Taha's algorithm for polynomial 0-1 programming (Q5426969) (← links)
- Algorithms for minclique scheduling problems (Q5961609) (← links)
