Computational comparison on the partitioning strategies in multiple choice integer programming (Q1266577): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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/0377-2217(94)00161-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1996382026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The knapsack problem with disjoint multiple-choice constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved penalty calculations for a mixed integer branch-and-bound algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization using special ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for multiple choice programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm for multiple-choice constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reporting computational experiments in mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized upper bounding techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for solving the multiple-choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Algorithms: A Framework and State-of-the-Art Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5610172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the knapsack problem with special ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the calculation of true and pseudo penalties in multiple choice integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ideal column algorithm for integer programs with special ordered sets of variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Investigation of some branch and bound strategies for the solution of mixed integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling Facility Location Problems as Generalized Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and Bound Methods for Multi-Item Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4103327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: School Timetabling—A Case in Large Binary Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Models for Sales Resource Allocation / rank
 
Normal rank

Latest revision as of 15:35, 28 May 2024

scientific article
Language Label Description Also known as
English
Computational comparison on the partitioning strategies in multiple choice integer programming
scientific article

    Statements

    Computational comparison on the partitioning strategies in multiple choice integer programming (English)
    0 references
    0 references
    0 references
    7 October 1998
    0 references
    weighted-mean-method
    0 references
    reformulation-and-transformation-technique
    0 references
    special ordered set
    0 references
    branch-and-bound
    0 references
    multiple choice integer programming
    0 references
    0 references
    0 references

    Identifiers