Algorithmus 25: Verfahren zur gemischt-ganzzahligen konvexen Optimierung

Rainer Ernst Burkard; H. Enge

doi:10.1007/BF02253549

Algorithmus 25: Verfahren zur gemischt-ganzzahligen konvexen Optimierung

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

Rainer Ernst Burkard, H. Enge

Research output: Contribution to journal › Article › peer-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 contribution	A method for mixed integer convex programming
Original language	German
Pages (from-to)	389-396
Journal	Computing <Wien>
Volume	14
Issue number	4
DOIs	https://doi.org/10.1007/BF02253549
Publication status	Published - 1975
Externally published	Yes

Access to Document

10.1007/BF02253549

Cite this

@article{d116c347b1584be38b8f6c7e5a17f2bc,

title = "Algorithmus 25: Verfahren zur gemischt-ganzzahligen konvexen Optimierung",

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]",

author = "Burkard, {Rainer Ernst} and H. Enge",

year = "1975",

doi = "10.1007/BF02253549",

language = "deutsch",

volume = "14",

pages = "389--396",

journal = "Computing <Wien>",

issn = "0010-485X",

publisher = "Springer Wien",

number = "4",

}

TY - JOUR

T1 - Algorithmus 25: Verfahren zur gemischt-ganzzahligen konvexen Optimierung

AU - Burkard, Rainer Ernst

AU - Enge, H.

PY - 1975

Y1 - 1975

N2 - 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]

AB - 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]

U2 - 10.1007/BF02253549

DO - 10.1007/BF02253549

M3 - Artikel

VL - 14

SP - 389

EP - 396

JO - Computing <Wien>

JF - Computing <Wien>

SN - 0010-485X

IS - 4

ER -

Algorithmus 25: Verfahren zur gemischt-ganzzahligen konvexen Optimierung

Abstract

Access to Document

Fingerprint

Cite this