Constraint programming approach to a bilevel scheduling problem (Q647473): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Gecode / rank
 
Normal rank
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.1007/s10601-010-9102-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994745260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint-based scheduling: Applying constraint programming to scheduling problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundle trust-region algorithm for bilinear bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel programming with discrete lower level problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quantified constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic-based Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominance-based heuristics for one-machine total cost scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel programming applied to the flow shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production planning problem with sequence dependent setups as a bilevel programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the weighted number of tardy jobs on a single machine with release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-binary quantified CSP: Algorithms and modelling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stackelberg-Nash-Cournot Equilibria: Characterizations and Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5324209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3524712 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:55, 4 July 2024

scientific article
Language Label Description Also known as
English
Constraint programming approach to a bilevel scheduling problem
scientific article

    Statements

    Constraint programming approach to a bilevel scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    23 November 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling
    0 references
    bilevel programming
    0 references
    constraint modeling
    0 references
    QCSP
    0 references
    Stackelberg game
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references