Pages that link to "Item:Q4158479"
From MaRDI portal
The following pages link to `` Strong '' NP-Completeness Results (Q4158479):
Displaying 50 items.
- A local search approach for two-dimensional irregular cutting (Q1908994) (← links)
- An optimal algorithm for preemptive on-line scheduling (Q1919176) (← links)
- FPGA implementation of a stochastic neural network for monotonic pseudo-Boolean optimization (Q1932035) (← links)
- Betweenness parameterized above tight lower bound (Q1959433) (← links)
- Approximation for knapsack problems with multiple constraints (Q1964357) (← links)
- Best fit bin packing with random order revisited (Q1979457) (← links)
- An EPTAS for scheduling fork-join graphs with communication delay (Q1998847) (← links)
- Makespan minimization with OR-precedence constraints (Q2059086) (← links)
- Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs (Q2093193) (← links)
- Performance guarantees of local search for minsum scheduling problems (Q2118098) (← links)
- A dynamic tree algorithm for peer-to-peer ridesharing matching (Q2129373) (← links)
- Scheduling jobs with a V-shaped time-dependent processing time (Q2215205) (← links)
- Deciding non-emptiness of hypergraph languages generated by connection-preserving fusion grammars is NP-complete (Q2232268) (← links)
- The piggyback transportation problem: transporting drones launched from a flying warehouse (Q2242297) (← links)
- A metric approach for scheduling problems with minimizing the maximum penalty (Q2245804) (← links)
- Task assignment algorithms for two-type heterogeneous multiprocessors (Q2251393) (← links)
- Worst-case analysis for on-line service policies (Q2268767) (← links)
- Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios (Q2294628) (← links)
- Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs (Q2304114) (← links)
- Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
- Complexity and approximation of the smallest \(k\)-enclosing ball problem (Q2346580) (← links)
- Online scheduling on two parallel machines with release dates and delivery times (Q2355989) (← links)
- A note on the Coffman-Sethi bound for LPT scheduling (Q2356126) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- Using a tabu search approach for solving the two-dimensional irregular cutting problem (Q2367010) (← links)
- Graphically structured value-function compilation (Q2389622) (← links)
- Priority-oriented route network planning for evacuation in constrained space scenarios (Q2420781) (← links)
- Complexity of unconstrained \(L_2 - L_p\) minimization (Q2436652) (← links)
- Analysis of Smith's rule in stochastic machine scheduling (Q2450731) (← links)
- Path constraints in semistructured data (Q2456353) (← links)
- The harmonious coloring problem is NP-complete for interval and permutation graphs (Q2457020) (← links)
- Operations research methods in preventing domino accidents in the chemical process industry (Abstract of thesis) (Q2477622) (← links)
- Approximating a vehicle scheduling problem with time windows and handling times (Q2481960) (← links)
- Data dependent worst case bounds for weighted set packing (Q2484341) (← links)
- Controlling the losing probability in a monotone game (Q2489238) (← links)
- Multiprocessor scheduling under precedence constraints: polyhedral results (Q2489902) (← links)
- An approximation algorithm for maximum triangle packing (Q2492197) (← links)
- The edge-orientation problem and some of its variants on weighted graphs (Q2509220) (← links)
- A branch-and-price-and-cut approach for sustainable crop rotation planning (Q2629731) (← links)
- A survey on scheduling problems with due windows (Q2630089) (← links)
- Two-stage matching-and-scheduling algorithm for real-time private parking-sharing programs (Q2664438) (← links)
- A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times (Q2668670) (← links)
- Schaefer's theorem for graphs (Q2796406) (← links)
- Online Scheduling on Two Parallel Machines with Release Times and Delivery Times (Q2867111) (← links)
- Scheduling problems with a common due window assignment: a survey (Q2877536) (← links)
- A note on complexity of genetic mutations (Q2890984) (← links)
- Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs (Q3163792) (← links)
- Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines (Q3186499) (← links)
- A Comparison of Random Task Graph Generation Methods for Scheduling Problems (Q3297563) (← links)
- Black and White Bin Packing Revisited (Q3467833) (← links)
