An alternative approach for proving the NP-hardness of optimization problems (Q320621): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Multiagent Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with time dependent processing times: Review and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with learning considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A state-of-the-art review on scheduling with learning effects / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for the complexity of high-multiplicity scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicity and complexity issues in contemporary production scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch scheduling with deadlines on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A concise survey of scheduling with time-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with learning effect considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: High Multiplicity in Earliness-Tardiness Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with high multiplicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximate algorithms for high-multiplicity parallel machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on scheduling on a single processor with speed dependent on a number of executed jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-dependent scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent time-dependent scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the number of tardy job units under release time constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling problems with actual time-dependent and job-dependent learning effect / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generic approach to proving NP-hardness of partition type problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric problem in scheduling theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to multi-parameter complexity analysis of discrete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling with a general exponential learning effect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling and due date assignment with rejection and position-dependent processing times / rank
 
Normal rank

Latest revision as of 15:55, 12 July 2024

scientific article
Language Label Description Also known as
English
An alternative approach for proving the NP-hardness of optimization problems
scientific article

    Statements

    An alternative approach for proving the NP-hardness of optimization problems (English)
    0 references
    0 references
    0 references
    7 October 2016
    0 references
    combinatorial optimization
    0 references
    computational complexity
    0 references
    scheduling
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references