Coordination Complexity of Parallel Price-Directive Decomposition
From MaRDI portal
Publication:4895561
Recommendations
- scientific article; zbMATH DE number 1215271
- scientific article; zbMATH DE number 1086924
- Approximate max-min resource sharing for structured concave optimization
- Solving Multicommodity Flow Problems by an Approximation Scheme
- Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
Cited in
(26)- Packing trees in communication networks
- Flows with unit path capacities and related packing and covering problems
- Determination of paths to vendor market effciency using parallel coordinates representation: A negotiation tool for buyers
- Regularized smoothing approximations to vertical nonlinear complementarity problems
- Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
- An asymptotic fully polynomial time approximation scheme for bin covering.
- Computer science and decision theory
- Approximation and online algorithms for multidimensional bin packing: a survey
- A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs
- Approximation schemes for job shop scheduling problems with controllable processing times
- An approximation algorithm for the general max-min resource sharing problem
- Approximation schemes for scheduling and covering on unrelated machines
- On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms
- scientific article; zbMATH DE number 1215271 (Why is no real title available?)
- Multicommodity network flows: A survey. II: Solution methods
- APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
- Faster min-max resource sharing in theory and practice
- A generalized approximation framework for fractional network flow and packing problems
- Resource sharing revisited: local weak duality and optimal convergence
- Self-concordant barriers for convex approximations of structured convex sets
- Global convergence of a smooth approximation method for mathematical programs with complementarity constraints
- Faster and simpler approximation algorithms for mixed packing and covering problems
- Approximation algorithms for general packing problems and their application to the multicast congestion problem
- Grouping techniques for scheduling problems: simpler and faster
- On routing in VLSI design and communication networks
- Scientific contributions of Leo Khachiyan (a short overview)
This page was built for publication: Coordination Complexity of Parallel Price-Directive Decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895561)
