Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Nonlinear integer programming algorithms: A survey

From MaRDI portal
Publication:1082264
Jump to:navigation, search

zbMath0602.90102MaRDI QIDQ1082264

B. George

Publication date: 1983

Published in: Opsearch (Search for Journal in Brave)


zbMATH Keywords

surveybranch-and-boundseparable programmingpenalty functionLinearizationpartial enumeration


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Mixed integer programming (90C11) Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)


Related Items (6)

A branch and bound algorithm for solving separable convex integer programming problems ⋮ Executing join queries in an uncertain distributed environment ⋮ Allocating relations in a distributed database system ⋮ A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs ⋮ A continuous approach to nonlinear integer programming ⋮ An improved branch and bound algorithm for mixed integer nonlinear programs




This page was built for publication: Nonlinear integer programming algorithms: A survey

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1082264&oldid=13108289"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 00:52.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki