A concurrent processing framework for the set partitioning problem (Q1603333): 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 / describes a project that uses
 
Property / describes a project that uses: OSL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Set-Partitioning Problem: Set Covering with Equality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Airline Crew Scheduling Problems by Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Column Generation Principle And The Airline Crew Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Column Generation Approach to the Urban Transit Crew Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint handling in genetic algorithms: the set partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Set Partitioning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiplier Adjustment Approach for the Set Partitioning Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems / 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: Covering, Packing and Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the integer properties of scheduling set partitioning models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter representations for set partitioning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph theoretic relaxations of set covering and set partitioning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulation of the set partitioning problem as a pure network with special order set constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:45, 4 June 2024

scientific article
Language Label Description Also known as
English
A concurrent processing framework for the set partitioning problem
scientific article

    Statements

    A concurrent processing framework for the set partitioning problem (English)
    0 references
    0 references
    11 July 2002
    0 references
    0 references