Dominance rules in combinatorial optimization problems (Q421551): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2010.11.008 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2010.11.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970600856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Optimization Via Marginal Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Dominance Relations in Branch-and-Bound Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outline of an algorithm for integer solutions to linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3274163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Solving Production-Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of Sequencing and Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4859840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4371290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backtrack Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184605 / 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: Q4131987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry Definitions for Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: General Symmetry Breaking Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjustment of heads and tails for the job-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with release dates on a single machine to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient heuristics to minimize total flow time with 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: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3274167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Programming by the Filter Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Bound Methods: General Formulation and Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Method of Solving Discrete Programming Problems / 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: Q5602534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Bound Methods: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—A Note on the Branch-and-Bound Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5623507 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2010.11.008 / rank
 
Normal rank

Latest revision as of 17:03, 9 December 2024

scientific article
Language Label Description Also known as
English
Dominance rules in combinatorial optimization problems
scientific article

    Statements

    Dominance rules in combinatorial optimization problems (English)
    0 references
    0 references
    0 references
    14 May 2012
    0 references
    combinatorial optimization
    0 references
    dominance rules
    0 references
    constraints
    0 references
    modeling
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers