scientific article; zbMATH DE number 1302171
From MaRDI portal
Publication:4247438
Recommendations
- Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming
- scientific article; zbMATH DE number 1383429
- scientific article; zbMATH DE number 1795208
- Exact penalty functions for nonlinear integer programming problems
- On the equivalence between some discrete and continuous optimization problems
Cited in
(14)- Improved penalty algorithm for mixed integer PDE constrained optimization problems
- On the equivalence between some discrete and continuous optimization problems
- Conic relaxations for semi-supervised support vector machines
- Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming
- scientific article; zbMATH DE number 1186901 (Why is no real title available?)
- Disnel: An application package for solving discrete and nonlinear optimization problems
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
- Continuous reformulations for zero-one programming problems
- scientific article; zbMATH DE number 1985655 (Why is no real title available?)
- A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems
- Analysis of penalty parameters in binary constrained extremum problems
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope
- In memoriam: Franco Giannessi (1935--2025)
- Existence and sum decomposition of vertex polyhedral convex envelopes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247438)
