Pages that link to "Item:Q4962739"

The following pages link to Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs (Q4962739):

Displaying 21 items.

• A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand (Q342327) (← links)
• Fixed-parameter tractability and lower bounds for stabbing problems (Q359746) (← links)
• A model for minimizing active processor time (Q487001) (← links)
• Evader interdiction: algorithms, complexity and collateral damage (Q490228) (← links)
• Capacitated dynamic lot-sizing problem with delivery/production time windows (Q613340) (← links)
• Primal-dual schema for capacitated covering problems (Q747765) (← links)
• Capacitated max-batching with interval graph compatibilities (Q899311) (← links)
• Geometric hitting set for segments of few orientations (Q1743112) (← links)
• Easy capacitated facility location problems, with connections to lot-sizing (Q1984675) (← links)
• Capacitated Arc Stabbing (Q2376793) (← links)
• The parameterized complexity of stabbing rectangles (Q2428672) (← links)
• Demand Hitting and Covering of Intervals (Q2971657) (← links)
• Constant Approximation Algorithm for Nonuniform Capacitated Multi-Item Lot Sizing via Strong Covering Inequalities (Q3387909) (← links)
• APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES (Q3397507) (← links)
• Primal-Dual Schema for Capacitated Covering Problems (Q3503854) (← links)
• Parameterized Complexity of Stabbing Rectangles and Squares in the Plane (Q3605506) (← links)
• Latency Constrained Aggregation in Chain Networks Admits a PTAS (Q3638456) (← links)
• (Q5091054) (← links)
• Geometric stabbing via threshold rounding and factor revealing LPs (Q6124825) (← links)
• Security-aware database migration planning (Q6154181) (← links)
• Priority-based bin packing with subset constraints (Q6184311) (← links)