Pages that link to "Item:Q4312415"

The following pages link to Improved Algorithms for Bipartite Network Flow (Q4312415):

Displaying 37 items.

• On a generalization of Nemhauser and Trotter's local optimization theorem (Q340561) (← links)
• Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs (Q492813) (← links)
• Structural and algorithmic properties for parametric minimum cuts (Q715078) (← links)
• The subset assignment problem for data placement in caches (Q724230) (← links)
• Approximability issues for unconstrained and constrained maximization of half-product related functions (Q730001) (← links)
• Efficient algorithms for robustness in resource allocation and scheduling problems (Q818137) (← links)
• Preemptive scheduling on uniform parallel machines with controllable job processing times (Q930610) (← links)
• Dynamic evolution of economically preferred facilities (Q954890) (← links)
• Using combinatorial optimization in model-based trimmed clustering with cardinality constraints (Q962299) (← links)
• A faster polynomial algorithm for the unbalanced Hitchcock transportation problem (Q1003485) (← links)
• Geometric quadrisection in linear time, with application to VLSI placement (Q1019299) (← links)
• A technique for speeding up the solution of the Lagrangean dual (Q1315429) (← links)
• A fast algorithm for the minimax flow problem with 0/1 weights (Q1370418) (← links)
• Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network. (Q1420448) (← links)
• A note on optimal covering augmentation for graphic polymatroids. (Q1603399) (← links)
• Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) (← links)
• Restricted assignment scheduling with resource constraints (Q1713408) (← links)
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
• Two level hierarchical time minimizing transportation problem (Q1769948) (← links)
• A strongly polynomial algorithm for the transportation problem (Q1804365) (← links)
• An efficient cost scaling algorithm for the assignment problem (Q1914072) (← links)
• An adaptive time slot assignment algorithm for variable bandwidth switching systems (Q1974277) (← links)
• Parameterized algorithms and complexity for the traveling purchaser problem and its variants (Q2084609) (← links)
• Scheduling jobs with sizes and delivery times on identical parallel batch machines (Q2202014) (← links)
• The partition bargaining problem (Q2473040) (← links)
• Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates (Q2482802) (← links)
• Level of repair analysis and minimum cost homomorphisms of graphs (Q2492189) (← links)
• Max-min sum minimization transportation problem (Q2507394) (← links)
• Network reinforcement (Q2583121) (← links)
• A space-efficient simulation algorithm on probabilistic automata (Q2629854) (← links)
• Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines (Q2806872) (← links)
• Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach (Q3541133) (← links)
• Reformulating linear programs with transportation constraints-With applications to workforce scheduling (Q4651722) (← links)
• Geometric algorithms for the minimum cost assignment problem (Q4845077) (← links)
• A Fluid Model for One-Sided Bipartite Matching Queues with Match-Dependent Rewards (Q5031622) (← links)
• On coresets for fair clustering in metric and Euclidean spaces and their applications (Q6152182) (← links)
• More efficient parallel flow algorithms (Q6487968) (← links)