Pages that link to "Item:Q2317129"

The following pages link to Scheduling meets \(n\)-fold integer programming (Q2317129):

Displaying 34 items.

• Scheduling personal finances via integer programming (Q367243) (← links)
• New algorithms for minimizing the weighted number of tardy jobs on a single machine (Q829184) (← links)
• On the parameterized tractability of single machine scheduling with rejection (Q1991260) (← links)
• Empowering the configuration-IP: new PTAS results for scheduling with setup times (Q2089776) (← links)
• Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
• About the complexity of two-stage stochastic IPs (Q2118129) (← links)
• A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679) (← links)
• Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
• Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
• The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (Q2238737) (← links)
• Parameterized complexity of a coupled-task scheduling problem (Q2283295) (← links)
• Improved approximation algorithms for two-stage flowshops scheduling problem (Q2285149) (← links)
• Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
• Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
• Block-structured integer programming: can we parameterize without the largest coefficient? (Q2684049) (← links)
• Parameterized and approximation results for scheduling with a low rank processing time matrix (Q4636620) (← links)
• Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
• Fixed-Parameter Approximation Schemes for Weighted Flowtime. (Q5009522) (← links)
• About the Complexity of Two-Stage Stochastic IPs (Q5041750) (← links)
• (Q5090421) (← links)
• (Q5090494) (← links)
• (Q5111743) (← links)
• Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding (Q5138974) (← links)
• (Q5874501) (← links)
• An EPTAS for scheduling on unrelated machines of few different types (Q5919620) (← links)
• High-multiplicity \(N\)-fold IP via configuration LP (Q6044979) (← links)
• Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines (Q6065415) (← links)
• A multivariate complexity analysis of the material consumption scheduling problem (Q6136081) (← links)
• On the parameterized tractability of single machine scheduling with rejection to minimize the weighted makespan (Q6535285) (← links)
• On the NP-hardness of two scheduling problems under linear constraints (Q6535800) (← links)
• Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines (Q6547133) (← links)
• FPT algorithms for a special block-structured integer program with applications in scheduling (Q6634532) (← links)
• Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming (Q6634533) (← links)
• Serial batching to minimize the weighted number of tardy jobs (Q6657883) (← links)