An approximate method for local optima for nonlinear mixed integer programming problems
type: Item
instance of: scholarly article
title: An approximate method for local optima for nonlinear mixed integer programming problems
zbMATH Open document ID: 0767.90055
DOI: 10.1016/0305-0548(92)90072-D
author: Han-Lin Li
published in: Computers \& Operations Research
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 95838
zbMATH Keywords: modified penalty function method
MaRDI profile type: Publication
cites work: Q3994385
cites work: Q3932576
cites work: A tree-search algorithm for mixed integer programming problems
cites work: Q4226179
cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
cites work: An Automatic Method of Solving Discrete Programming Problems
cites work: Quadratic Binary Programming with Application to Capital-Budgeting Problems
cites work: An implicit branch-and-bound algorithm for mixed-integer linear programming
cites work: Q4040221
cites work: Q4077727
cites work: A Balasian-Based Algorithm for Zero-One Polynomial Programming
cites work: Solving Mixed Integer Programming Problems Using Automatic Reformulation
description: scientific article; zbMATH DE number 95838