Reducing the number of variables in integer quadratic programming problem (Q967821): 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.1016/j.apm.2009.06.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2045604168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming algorithms for the optimal cutting of equal rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregate line capacity design for PWB assembly systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing the number of variables in integer and linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on reducing the number of variables in integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new variable reduction technique for convex integer quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on dominance relation in unbounded knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Elimination of Integer Variables / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:36, 2 July 2024

scientific article
Language Label Description Also known as
English
Reducing the number of variables in integer quadratic programming problem
scientific article

    Statements