An optimization method for solving mixed discrete-continuous programming problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 786571
- Solving nonlinear programming problems involving discrete, integer, and continuous variables
- A continuous strategy to solve a class of mixed optimization problems
- An exact penalty function method for nonlinear mixed discrete programming problems
- An Algorithm Model for Mixed Variable Programming
Cites work
- scientific article; zbMATH DE number 4043605 (Why is no real title available?)
- scientific article; zbMATH DE number 970369 (Why is no real title available?)
- A two-phase optimization procedure for integer programming problems
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Generalized Benders decomposition
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Nonlinear Programming with the Aid of a Multiple-Gradient Summation Technique
- Solving mixed integer nonlinear programs by outer approximation
Cited in
(7)- A bacterial gene recombination algorithm for solving constrained optimization problems
- A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
- Solving nonlinear programming problems involving discrete, integer, and continuous variables
- A novel modified differential evolution algorithm for constrained optimization problems
- A continuous strategy to solve a class of mixed optimization problems
- scientific article; zbMATH DE number 3993304 (Why is no real title available?)
- APROS: Algorithmic Development Methodology for Discrete-Continuous Optimization Problems
This page was built for publication: An optimization method for solving mixed discrete-continuous programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2519622)
