A two-phase optimization procedure for integer programming problems
From MaRDI portal
Recommendations
Cites work
- A Rapidly Convergent Descent Method for Minimization
- An Automatic Method of Solving Discrete Programming Problems
- An enhanced integer simplicial optimization method for minimum cost spares for k-out-of-n systems
- An Iterative Method for Finding Stationary Values of a Function of Several Variables
- scientific article; zbMATH DE number 4043605 (Why is no real title available?)
- scientific article; zbMATH DE number 3744913 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3438635 (Why is no real title available?)
- scientific article; zbMATH DE number 3331337 (Why is no real title available?)
- k-out-of-m system availability with minimum-cost allocation spares
- Nonlinear Programming with the Aid of a Multiple-Gradient Summation Technique
- Reliability Optimization Problems with Multiple Constraints
- System Availability and Optimum Spare Units
Cited in
(9)- An improved partial enumeration algorithm for integer programming problems
- Implementation of an integer optimization platform using object oriented programming
- General purpose heuristics for integer programming. II
- An optimization method for solving mixed discrete-continuous programming problems
- A two-phase linear programming approach for redundancy allocation problems
- Algorithms and Computation
- Direct phasing by binary integer programming
- A partial enumeration algorithm for pure nonlinear integer programming
- Investigation of a two-stage integer problem of quantile optimization
This page was built for publication: A two-phase optimization procedure for integer programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1609029)