Algorithmus 25: Verfahren zur gemischt-ganzzahligen konvexen Optimierung

Translated title of the contribution: A method for mixed integer convex programming

Research output: Contribution to journalArticlepeer-review

Abstract

This paper contains an ALGOL-Procedure for solving mixed integer programming problems with convex objective function and constraints according to a method of Burkard [2]
Translated title of the contributionA method for mixed integer convex programming
Original languageGerman
Pages (from-to)389-396
JournalComputing
Volume14
Issue number4
DOIs
Publication statusPublished - 1975
Externally publishedYes

Fingerprint

Dive into the research topics of 'A method for mixed integer convex programming'. Together they form a unique fingerprint.

Cite this