Product
Help
Pricing
About
Jobs
Log in
Get started
Work
Add to collection
A General Class of Greedily Solvable Linear Programs
HTML
Details
Locations
Year:
1998
Type:
article
Source:
Mathematics of Operations Research
DOI:
10.1287/moor.23.4.892
Authors:
Maurice Queyranne,
Frits Spieksma,
Fabio Tardella
Institutions:
University of British Columbia,
Maastricht University,
Sapienza University of Rome
Language:
English
Topic:
Complexity and Algorithms in Graphs
Subfield:
Computational Theory and Mathematics
Field:
Computer Science
Domain:
Physical Sciences
Keywords:
greedy algorithm,
linear programming,
submodular functions,
Monge property,
transportation problem,
polymatroids,
sublattices,
Boolean algebra,
rooted forests,
production and logistics
show all 10
Open Access status:
closed
Funders:
Centre National de la Recherche Scientifique,
Natural Sciences and Engineering Research Council of Canada
OpenAlex ID:
W50423135
FWCI:
3.038
Cites:
47
Cited by:
40
Related to:
10