A two-phase optimization procedure for integer programming problems

DOI10.1016/S0898-1221(01)00264-4zbMath0994.90100OpenAlexW1978157509MaRDI QIDQ1609029

R. Smith

Publication date: 15 August 2002

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(01)00264-4

zbMATH Keywords

unconstrained optimizationconstrained optimization

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (3)

A partial enumeration algorithm for pure nonlinear integer programming ⋮ An optimization method for solving mixed discrete-continuous programming problems ⋮ An improved partial enumeration algorithm for integer programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Automatic Method of Solving Discrete Programming Problems
• An Iterative Method for Finding Stationary Values of a Function of Several Variables
• k-out-of-m system availability with minimum-cost allocation spares
• An enhanced integer simplicial optimization method for minimum cost spares for k-out-of-n systems
• System Availability and Optimum Spare Units
• Reliability Optimization Problems with Multiple Constraints
• A Rapidly Convergent Descent Method for Minimization
• Nonlinear Programming with the Aid of a Multiple-Gradient Summation Technique

This page was built for publication: A two-phase optimization procedure for integer programming problems