Pages that link to "Item:Q881568"

The following pages link to Partially ordered knapsack and applications to scheduling (Q881568):

Displaying 14 items.

• Reductions between scheduling problems with non-renewable resources and knapsack problems (Q482287) (← links)
• Most balanced minimum cuts (Q968139) (← links)
• Subset sum problems with digraph constraints (Q1631654) (← links)
• Optimizing a mineral value chain with market uncertainty using Benders decomposition (Q1755250) (← links)
• The knapsack problem with neighbour constraints (Q1932367) (← links)
• LAD models, trees, and an analog of the fundamental theorem of arithmetic (Q1949097) (← links)
• The knapsack problem with special neighbor constraints (Q2123119) (← links)
• Approximation algorithms for simple assembly line balancing problems (Q2125223) (← links)
• A strengthened formulation and cutting planes for the open pit mine production scheduling problem (Q2270449) (← links)
• Approximations for the two-machine cross-docking flow shop problem (Q2446855) (← links)
• On the complexity of project scheduling to minimize exposed time (Q2514874) (← links)
• Precedence-Constrained Min Sum Set Cover (Q5136276) (← links)
• Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items (Q6106591) (← links)
• Exact and heuristic methods for a workload allocation problem with chain precedence constraints (Q6112777) (← links)