Generalized cover facet inequalities for the generalized assignment problem (Q3553764): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the generalised assignment problem using polyhedral results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of inequalities for the generalized assignment polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: (1,k)-configuration facets for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized assignment problem: Valid inequalities and facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiplier Adjustment Method for the Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Note on Zero-One Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian Dual-Based Branch-and-Bound Algorithm for the Generalized Multi-Assignment Problem / 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: A Branch-and-Price Algorithm for the Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faces for a linear inequality in 0–1 variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Facets and Strong Valid Inequalities for Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid Inequalities and Superadditivity for 0–1 Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting the facets of zero–one polytopes / rank
 
Normal rank

Latest revision as of 17:48, 2 July 2024

scientific article
Language Label Description Also known as
English
Generalized cover facet inequalities for the generalized assignment problem
scientific article

    Statements

    Generalized cover facet inequalities for the generalized assignment problem (English)
    0 references
    0 references
    21 April 2010
    0 references
    0 references
    generalized assignment problem
    0 references
    Knapsack problem
    0 references
    special ordered set
    0 references
    facet inequalities
    0 references
    generalized cover
    0 references
    0 references
    0 references