The following pages link to RELAX4 (Q22490):
Displaying 41 items.
- Minimal-cost network flow problems with variable lower bounds on arc flows (Q632657) (← links)
- A least-squares minimum-cost network flow algorithm (Q646641) (← links)
- Updating network flows given multiple, heterogeneous arc attribute changes (Q655194) (← links)
- Relaxation methods for monotropic programs (Q909583) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- The auction algorithm for the transportation problem (Q918416) (← links)
- Rake linking for suburban train services (Q998693) (← links)
- Dual coordinate step methods for linear network flow problems (Q1115790) (← links)
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems (Q1122488) (← links)
- On the dual coordinate ascent approach for nonlinear networks (Q1207203) (← links)
- A generic auction algorithm for the minimum cost network flow problem (Q1315446) (← links)
- Parallel primal-dual methods for the minimum cost flow problem (Q1315451) (← links)
- The auction algorithm: A distributed relaxation method for the assignment problem (Q1320412) (← links)
- Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations (Q1342646) (← links)
- An incremental primal-dual method for generalized networks (Q1342940) (← links)
- Applying steepest-edge techniques to a network primal-dual algorithm (Q1362969) (← links)
- Efficient parallel algorithms for the minimum cost flow problem (Q1379929) (← links)
- Simultaneous lotsizing and scheduling on parallel machines (Q1604070) (← links)
- Network DEA-based biobjective optimization of product flows in a supply chain (Q1639292) (← links)
- An auction algorithm for the max-flow problem (Q1906750) (← links)
- Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup (Q2239950) (← links)
- A decomposition approach for the general lotsizing and scheduling problem for parallel production lines (Q2355899) (← links)
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks (Q3140000) (← links)
- A one-step tabu search algorithm for manufacturing cell design (Q3157354) (← links)
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems (Q3813579) (← links)
- (Q4283439) (← links)
- (Q4283446) (← links)
- (Q4320084) (← links)
- (Q4355915) (← links)
- (Q4636980) (← links)
- An ε-Relaxation method for generalized separable convex cost network flow problems (Q4645915) (← links)
- Solving generalized transportation problems via pure transportation problems (Q4805632) (← links)
- Algorithms for Capacitated, Multi-Item Lot-Sizing without Set-Ups (Q4838215) (← links)
- Efficient Solution of the Single-item, Capacitated Lot-sizing Problem with Start-up and Reservation Costs (Q4864350) (← links)
- Solving the CLSP by a Tabu Search Heuristic (Q4868835) (← links)
- Min-Cost Flow in Unit-Capacity Planar Graphs (Q5075811) (← links)
- Reverse Auction and the Solution of Inequality Constrained Assignment Problems (Q5287103) (← links)
- A Network Flow Algorithm for Binary Image Reconstruction from Few Projections (Q5386012) (← links)
- (Q5434304) (← links)
- Full Matching in an Observational Study of Coaching for the SAT (Q5754762) (← links)
- A simple GAP-canceling algorithm for the generalized maximum flow problem (Q5901710) (← links)
