Pages that link to "Item:Q3964296"

The following pages link to Computing Maximal “Polymatroidal” Network Flows (Q3964296):

Displaying 28 items.

• A fast cost scaling algorithm for submodular flow (Q294751) (← links)
• A competitive two-agent scheduling problem on parallel machines with release dates and preemption (Q460140) (← links)
• Graph cuts with interacting edge weights: examples, approximations, and algorithms (Q517305) (← links)
• Polymatroidal flows with lower bounds (Q581209) (← links)
• A node-capacitated Okamura-Seymour theorem (Q747769) (← links)
• Finding feasible vectors of Edmonds-Giles polyhedra (Q796541) (← links)
• Testing membership in matroid polyhedra (Q1056350) (← links)
• Maximal dynamic polymatroid flows and applications (Q1077321) (← links)
• An out-of-kilter method for submodular flows (Q1095780) (← links)
• Generalized polymatroids and submodular flows (Q1116889) (← links)
• Directed submodularity, ditroids and directed submodular flows (Q1116891) (← links)
• An application of submodular flows (Q1119596) (← links)
• Minimization on submodular flows (Q1167658) (← links)
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region (Q1179000) (← links)
• New algorithms for the intersection problem of submodular systems (Q1202762) (← links)
• Countable Menger's theorem with finitary matroid constraints on the ingoing edges (Q1658749) (← links)
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (Q1850505) (← links)
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
• Simple push-relabel algorithms for matroids and submodular flows (Q1926643) (← links)
• A note on polylinking flow networks (Q1942270) (← links)
• Separation, dimension, and facet algorithms for node flow polyhedra (Q2638390) (← links)
• Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
• Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives (Q2976146) (← links)
• Proving total dual integrality with cross-free families—A general framework (Q3313630) (← links)
• Structures of polyhedra determined by submodular functions on crossing families (Q3337243) (← links)
• Polyhedral Clinching Auctions for Two-Sided Markets (Q5076699) (← links)
• A characterization of network representable polymatroids (Q5202490) (← links)
• Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications (Q5918723) (← links)