A pseudopolynomial network flow formulation for exact knapsack separation (Q4014772): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1002/net.3230220507 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973520467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling with integer variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:35, 16 May 2024

scientific article
Language Label Description Also known as
English
A pseudopolynomial network flow formulation for exact knapsack separation
scientific article

    Statements

    A pseudopolynomial network flow formulation for exact knapsack separation (English)
    0 references
    0 references
    0 references
    13 October 1992
    0 references
    knapsack optimization
    0 references

    Identifiers

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