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

A probe-based algorithm for piecewise linear optimization in scheduling

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

DOI10.1023/A:1021897321637zbMath1029.90043OpenAlexW36635123MaRDI QIDQ1861934

Farid Ajili, Hani El-Sakkout

Publication date: 10 March 2003

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021897321637


zbMATH Keywords

linear programmingschedulinghybrid algorithmsconstraint programming


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)


Related Items (1)

A parametric simplex algorithm for biobjective piecewise linear programming problems




This page was built for publication: A probe-based algorithm for piecewise linear optimization in scheduling

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