The 0-1 Programming Solution for the Problem of Resource Allocation
- Guoliang Luo
- Xingang Zhao
Abstract
In this article, we first translated the problem of disperse resource allocation into the 0-1 programming problem, and put forward the special solution based on the relative difference quotient aiming at the particularity of resource allocation 0-1 programming model. And the example proved that the new algorithm was effective and fast.- Full Text: PDF
- DOI:10.5539/jsd.v2n1p87
This work is licensed under a Creative Commons Attribution 4.0 License.
Journal Metrics
h-index (2017): 33
i10-index (2017): 81
h5-Index (2017): 18
h5-Media (2017): 25
Index
- Academic Journals Database
- ACNP
- AGRICOLA
- ANVUR (Italian National Agency for the Evaluation of Universities and Research Institutes)
- Berkeley Library
- CAB Abstracts
- CNKI Scholar
- COPAC
- CrossRef
- DTU Library
- EBSCOhost
- Elektronische Zeitschriftenbibliothek (EZB)
- EuroPub Database
- Excellence in Research for Australia (ERA)
- Genamics JournalSeek
- GETIT@YALE (Yale University Library)
- Ghent University Library
- Google Scholar
- Harvard Library
- INDEX ISLAMICUS
- Infotrieve
- Jisc Library Hub Discover
- JournalGuide
- JournalTOCs
- LOCKSS
- Max Planck Institutes
- MIAR
- Mir@bel
- NewJour
- Norwegian Centre for Research Data (NSD)
- Open J-Gate
- PKP Open Archives Harvester
- Pollution Abstracts
- Publons
- Pubmed journal list
- RePEc
- ROAD
- SafetyLit
- Scilit
- SHERPA/RoMEO
- Standard Periodical Directory
- Stanford Libraries
- UCR Library
- Ulrich's
- UniCat
- Universe Digital Library
- UoS Library
- WJCI Report
- WorldCat
- WorldWideScience
- Zeitschriften Daten Bank (ZDB)
Contact
- Sherry SunEditorial Assistant
- jsd@ccsenet.org