Pages that link to "Item:Q4158479"
From MaRDI portal
The following pages link to `` Strong '' NP-Completeness Results (Q4158479):
Displaying 50 items.
- Modeling uncertainty in networks (Q1310211) (← links)
- A note on generalizing the maximum lateness criterion for scheduling (Q1315993) (← links)
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective (Q1318519) (← links)
- Database placement in communication networks for minimizing the overall transmission cost (Q1324221) (← links)
- Feasibility of scheduling lot sizes of two frequencies on one machine (Q1331610) (← links)
- A convex geometric approach to counting the roots of a polynomial system (Q1338221) (← links)
- A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits (Q1339115) (← links)
- Polynomial time approximation schemes for class-constrained packing problems (Q1348737) (← links)
- Judicious partitions of hypergraphs (Q1356017) (← links)
- On locating cubic subgraphs in bounded-degree connected bipartite graphs (Q1356566) (← links)
- On the use of Boolean methods for the computation of the stability number (Q1363750) (← links)
- Maximizing the weighted number of on-time jobs in single machine scheduling with time windows (Q1368435) (← links)
- Single machine scheduling with discretely controllable processing times (Q1373460) (← links)
- On the two-connected planar spanning subgraph polytope (Q1382280) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) (← links)
- Covering regular graphs (Q1386472) (← links)
- Is a unit-job shop not easier than identical parallel machines? (Q1392555) (← links)
- On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
- Fault tolerant \(K\)-center problems (Q1575549) (← links)
- The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability (Q1577995) (← links)
- Applying extra-resource analysis to load balancing. (Q1588056) (← links)
- Compiling constraint satisfaction problems (Q1606322) (← links)
- Minimizing makespan on parallel machines subject to release dates and delivery times (Q1607981) (← links)
- A parallel machine schedule updating game with compensations and clients averse to uncertain loss (Q1634066) (← links)
- Tropically convex constraint satisfaction (Q1635805) (← links)
- Tool-feeder partitions for module assignment in PCB assembly (Q1652060) (← links)
- A fast two-level variable neighborhood search for the clustered vehicle routing problem (Q1652293) (← links)
- On maximum common subgraph problems in series-parallel graphs (Q1678090) (← links)
- An improved algorithm for the \(L_2-L_p\) minimization problem (Q1683685) (← links)
- On scheduling with non-increasing time slot cost to minimize total weighted completion time (Q1702736) (← links)
- Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs (Q1744245) (← links)
- Scheduling on uniform processors with at most one downtime on each machine (Q1751114) (← links)
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints (Q1751662) (← links)
- Scheduling reclaimer operations in the stockyard to minimize makespan (Q1782041) (← links)
- Bounding stochastic dependence, joint mixability of matrices, and multidimensional bottleneck assignment problems (Q1785325) (← links)
- Easy knapsacks and the complexity of energy allocation problems in the smart grid (Q1800444) (← links)
- Semidefinite and linear programming integrality gaps for scheduling identical machines (Q1800998) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- An approximation algorithm for computing longest paths. (Q1812006) (← links)
- On the NP-hardness of edge-deletion and -contraction problems (Q1838829) (← links)
- An effective quasi-human based heuristic for solving the rectangle packing problem (Q1847202) (← links)
- Single machine earliness-tardiness scheduling with resource-dependent release dates (Q1847239) (← links)
- A note on minimum makespan assembly plans (Q1848367) (← links)
- On weighted vs unweighted versions of combinatorial optimization problems (Q1854428) (← links)
- \(\kappa\)-partitioning problems for maximizing the minimum load (Q1879573) (← links)
- Scheduling shops to minimize the weighted number of late jobs (Q1890952) (← links)
- On component-size bounded Steiner trees (Q1894356) (← links)
- A new algorithm for the propositional satisfiability problem (Q1894360) (← links)
- Polynomially solvable cases for the maximum stable set problem (Q1894362) (← links)
- Shop scheduling problems with multiprocessor tasks on dedicated processors (Q1897372) (← links)
