A graphical approach to solve an investment optimization problem (Q483269): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10852-013-9248-2 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91G50 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C39 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C90 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6380834 / rank
 
Normal rank
Property / zbMATH Keywords
 
project investment
Property / zbMATH Keywords: project investment / rank
 
Normal rank
Property / zbMATH Keywords
 
graphical algorithm
Property / zbMATH Keywords: graphical algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
pseudo-polynomial time complexity
Property / zbMATH Keywords: pseudo-polynomial time complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
FPTAS
Property / zbMATH Keywords: FPTAS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10852-013-9248-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1963937004 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57633793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconvex piecewise linear knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-product lot-sizing and sequencing on a single imperfect machine / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10852-013-9248-2 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:55, 9 December 2024

scientific article
Language Label Description Also known as
English
A graphical approach to solve an investment optimization problem
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references