RELAX4

swMATH10531MaRDI QIDQ22490FDOQ22490

Author name not available (Why is that?)

Cited In (41)

• Reverse Auction and the Solution of Inequality Constrained Assignment Problems
• Min-Cost Flow in Unit-Capacity Planar Graphs
• A one-step tabu search algorithm for manufacturing cell design
• Applying steepest-edge techniques to a network primal-dual algorithm
• Minimal-cost network flow problems with variable lower bounds on arc flows
• A simple GAP-canceling algorithm for the generalized maximum flow problem
• An incremental primal-dual method for generalized networks
• Title not available (Why is that?)
• Dual coordinate step methods for linear network flow problems
• Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
• Network DEA-based biobjective optimization of product flows in a supply chain
• Rake linking for suburban train services
• An ε-Relaxation method for generalized separable convex cost network flow problems
• Title not available (Why is that?)
• Solving the CLSP by a Tabu Search Heuristic
• Parallel primal-dual methods for the minimum cost flow problem
• Efficient Solution of the Single-item, Capacitated Lot-sizing Problem with Start-up and Reservation Costs
• Algorithms for Capacitated, Multi-Item Lot-Sizing without Set-Ups
• Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup
• The auction algorithm for the transportation problem
• Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations
• Simultaneous lotsizing and scheduling on parallel machines
• Title not available (Why is that?)
• A generic auction algorithm for the minimum cost network flow problem
• A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
• Relaxation methods for monotropic programs
• A survey of dynamic network flows
• A least-squares minimum-cost network flow algorithm
• Title not available (Why is that?)
• Updating network flows given multiple, heterogeneous arc attribute changes
• Title not available (Why is that?)
• On the dual coordinate ascent approach for nonlinear networks
• Full Matching in an Observational Study of Coaching for the SAT
• A Network Flow Algorithm for Binary Image Reconstruction from Few Projections
• A decomposition approach for the general lotsizing and scheduling problem for parallel production lines
• Efficient parallel algorithms for the minimum cost flow problem
• An auction algorithm for the max-flow problem
• An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
• Title not available (Why is that?)
• Solving generalized transportation problems via pure transportation problems
• The auction algorithm: A distributed relaxation method for the assignment problem

This page was built for software: RELAX4