Pages that link to "Item:Q916563"

The following pages link to Monge sequences, antimatroids, and the transportation problem with forbidden arcs (Q916563):

Displaying 15 items.

• Some of my favorite integer programming applications at IBM (Q537591) (← links)
• A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs (Q685703) (← links)
• Monge and feasibility sequences in general flow problems (Q686244) (← links)
• Minimizing the number of tardy job units under release time constraints (Q919993) (← links)
• A fast bipartite network flow algorithm for selective assembly (Q1273091) (← links)
• On Monge sequences in \(d\)-dimensional arrays (Q1375084) (← links)
• Allocation under a general substitution structure (Q1737487) (← links)
• On the recognition of permuted bottleneck Monge matrices (Q1902890) (← links)
• Perspectives of Monge properties in optimization (Q1923588) (← links)
• Robinsonian matrices: recognition challenges (Q2403299) (← links)
• Monge properties, discrete convexity and applications (Q2432877) (← links)
• Reformulating linear programs with transportation constraints-With applications to workforce scheduling (Q4651722) (← links)
• Optimal couplings are totally positive and more (Q4822470) (← links)
• Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem (Q4995102) (← links)
• Avoiding unnecessary demerging and remerging of multi‐commodity integer flows (Q6092659) (← links)