Pages that link to "Item:Q4158479"
From MaRDI portal
The following pages link to `` Strong '' NP-Completeness Results (Q4158479):
Displaying 36 items.
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability (Q3637311) (← links)
- The complexity of the network design problem (Q4178943) (← links)
- NP-Complete operations research problems and approximation algorithms (Q4187586) (← links)
- Parallel flowshop scheduling using Tabu search (Q4474674) (← links)
- (Q4633050) (← links)
- Scheduling Opposing Forests (Q4745255) (← links)
- Scheduling manufacturing systems for delayed product differentiation in agile manufacturing (Q4807200) (← links)
- On solving Travelling Salesman Problem with Vertex Requisitions (Q4987704) (← links)
- Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation (Q5086008) (← links)
- Best Fit Bin Packing with Random Order Revisited (Q5089165) (← links)
- Symmetry-driven network reconstruction through pseudobalanced coloring optimization (Q5101076) (← links)
- Computational Complexity of Atomic Chemical Reaction Networks (Q5127181) (← links)
- Scheduling with variable time slot costs (Q5189246) (← links)
- Constraint Satisfaction Problems with Infinite Templates (Q5504704) (← links)
- Dominating cliques in graphs (Q5896554) (← links)
- A note on LPT scheduling (Q5906502) (← links)
- Realization problems on reachability sequences (Q5925515) (← links)
- The computational complexity of the criticality problems in a network with interval activity times (Q5953342) (← links)
- Algorithms for minclique scheduling problems (Q5961609) (← links)
- On the complexity of coupled-task scheduling (Q5961610) (← links)
- LPT online strategy for parallel-machine scheduling with kind release times (Q5963697) (← links)
- A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum (Q6045460) (← links)
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing (Q6046946) (← links)
- Scheduling with deterioration effects and maintenance activities under parallel processors (Q6048066) (← links)
- Worst-case analysis of LPT scheduling on a small number of non-identical processors (Q6072208) (← links)
- A Tight (3/2+ε) Approximation for Skewed Strip Packing. (Q6084400) (← links)
- Exact and heuristic solution approaches for energy-efficient identical parallel machine scheduling with time-of-use costs (Q6096614) (← links)
- Computing welfare-maximizing fair allocations of indivisible goods (Q6109821) (← links)
- On the complexity of scheduling unrelated parallel machines with limited preemptions (Q6161912) (← links)
- A Log-Linear $$(2 +5/6)$$-Approximation Algorithm for Parallel Machine Scheduling with a Single Orthogonal Resource (Q6487188) (← links)
- Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time (Q6577341) (← links)
- Computational complexity of counting coincidences (Q6614012) (← links)
- Equality cases of the Alexandrov-Fenchel inequality are not in the polynomial hierarchy (Q6642430) (← links)
- Algorithms for the bin packing problem with scenarios (Q6646755) (← links)
- No existence of a linear algorithm for the one-dimensional Fourier phase retrieval (Q6649702) (← links)
- Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems (Q6657887) (← links)