Polynomial Approximations for Continuous Linear Programs

Continuous linear programs have attracted considerable interest due to their potential for modeling manufacturing, scheduling, and routing problems. While efficient simplex-type algorithms have been developed for separated continuous linear programs, crude time discretization remains the method of c...

Celý popis

Podrobná bibliografia

Vydané v:	SIAM journal on optimization Ročník 22; číslo 2; s. 628 - 648
Hlavní autori:	Bampou, Dimitra, Kuhn, Daniel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2012
Predmet:	Algorithms Approximation Linear programming Optimization Polynomials
ISSN:	1052-6234, 1095-7189
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!