OpenAlex
PricingAboutJobs
Log inGet started
Work

A General Class of Greedily Solvable Linear Programs

HTML

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

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
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security