Scheduling kernels via configuration LP
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A Linear Programming Approach to the Cutting-Stock Problem
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- A structural approach to kernels for ILPs: treewidth and total unimodularity
- Advice classes of parametrized tractability
- An application of simultaneous diophantine approximation in combinatorial optimization
- Carathéodory bounds for integer cones
- Change-making problems revisited: a parameterized point of view
- Combinatorial \(n\)-fold integer programming and applications
- Convex separable optimization is not much harder than linear optimization
- Faster Algorithms for Integer Programs with Block Structure
- Integer programming in parameterized complexity: three miniatures
- Interval scheduling and colorful independent sets
- Kernelization of graph Hamiltonicity: proper \(H\)-graphs
- Kernelization. Theory of parameterized preprocessing
- Knapsack problems: a parameterized point of view
- Lossy kernelization
- On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility
- On \((1+\varepsilon)\)-approximate data reduction for the Rural Postman problem
- On polynomial kernels for sparse integer linear programs
- On the parameterized tractability of single machine scheduling with rejection
- On the parameterized tractability of the just-in-time flow-shop scheduling problem
- On the parametric complexity of schedules to minimize tardy tasks.
- Parameterized algorithms
- Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
- Parameterized complexity of machine scheduling: 15 open problems
- Polynomial kernels for weighted problems
- Polynomiality for bin packing with a constant number of item types
- Scheduling and fixed-parameter tractability
- Scheduling meets n-fold integer programming
- Scheduling two competing agents when one agent has significantly fewer jobs
- Structural parameters for scheduling with assignment restrictions
- The clever shopper problem
- The modified integer round-up property of the one-dimensional cutting stock problem
- The support of integer optimal solutions
- \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling
Cited in
(4)
This page was built for publication: Scheduling kernels via configuration LP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969606)
