Unconstrained 0-1 nonlinear programming: A nondifferentiable approach
From MaRDI portal
The unconstrained 0-1 nonlinear programming problem is reduced to a nonlinear continuous problem where the objective function is piecewise linear. In the first formulation the objective function is the difference of two convex functions. In the other two formulations one gets concave problems having fewer integer local minima than by reduction in a classical way.
Recommendations
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- An approximate method for local optima for nonlinear mixed integer programming problems
- A continuous approach to 0-1 nonlinear problem and its solution with genetic algorithm
- Reduction of nonlinear integer separable programming problems∗
- Nonlinear 0–1 programming: I. Linearization techniques
Cites work
- An exact penalty approach for solving a class of minimization problems with boolean variables
- Constrained global optimization: algorithms and applications
- scientific article; zbMATH DE number 4011808 (Why is no real title available?)
- scientific article; zbMATH DE number 3783030 (Why is no real title available?)
- scientific article; zbMATH DE number 3404028 (Why is no real title available?)
- Minimum cuts and related problems
- Penalty formulation for zero-one nonlinear programming
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
Cited in
(11)- A global continuation algorithm for solving binary quadratic programming problems
- An approximate method for local optima for nonlinear mixed integer programming problems
- A Boolean penalty method for zero-one nonlinear programming
- On complexity of unconstrained hyperbolic 0--1 programming problems
- scientific article; zbMATH DE number 3860887 (Why is no real title available?)
- Nonlinear one-parametric bottleneck linear programming
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- A continuous approach to 0-1 nonlinear problem and its solution with genetic algorithm
- A smoothing method for zero--one constrained extremum problems
- ``Miniaturized linearizations for quadratic 0/1 problems
- Steepest descent method for solving zero-one nonlinear programming problems
This page was built for publication: Unconstrained 0-1 nonlinear programming: A nondifferentiable approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1187840)
