Minimum Concave Cost Flows in Certain Networks
From MaRDI portal
Publication:5545167
Cited in
(79)- Two-level lot-sizing with inventory bounds
- Cross-facility management of production and transportation planning problem
- A survey of dynamic network flows
- Progressive hedging as a meta-heuristic applied to stochastic lot-sizing
- An optimal irrigation network with infinitely many branching points
- A concave cost stochastic replacement problem.
- Comparative studies on dynamic programming and integer programming approaches for concave cost production/inventory control problems
- An improved branch and bound algorithm for minimum concave cost network flow problems
- An efficient approach for solving the lot-sizing problem with time-varying storage capacities
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
- scientific article; zbMATH DE number 1310285 (Why is no real title available?)
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems
- Population monotonic allocation schemes for the two-period economic lot-sizing games
- Concave cost minimization on networks
- Adjacent extreme flows and application to min concave cost flow problems
- Minimal-cost network flow problems with variable lower bounds on arc flows
- Progress with single-item lot-sizing
- An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies
- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- The plant location and flexible technology acquisition problem.
- Minimum concave cost production system: A further generalization of multi-echelon model
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Lot sizing with inventory gains
- Probabilistic local search algorithms for concave cost transportation network problems
- Dynamic lot-sizing model for major and minor demands
- The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
- Dynamic lot-sizing with price changes and price-dependent holding costs
- An algorithm for the min concave cost flow problem
- Sensitivity analysis of the economic lot-sizing problem
- A decomposition method for the min concave cost flow problem with a staircase structure
- A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
- The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs
- A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure
- A tabu search heuristic procedure for the fixed charge transportation problem
- Resource downgrading
- Dynamic economic lot size model with perishable inventory and capacity constraints
- Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs
- Enumerative techniques for solving some nonconvex global optimization problems
- The multiscenario lot size problem with concave costs.
- Strongly polynomial algorithm for two special minimum concave cost network flow problems
- A branch-and-bound algorithm for concave network flow problems
- The economic lot-sizing problem with perishable items and consumption order preference
- Scheduling multiple products on parallel machines with setup costs
- Capacity expansion with alternative technology choices
- The simple plant location problem: Survey and synthesis
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
- Single-point stochastic search algorithms for the multi-level lot-sizing problem
- A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment
- A dynamic programming approach for the pipe network layout problem
- An integrated model for facility location and technology acquisition
- Strategic design of distribution systems with economies of scale in transportation
- Stochastic lot-sizing problem with inventory-bounds and constant order-capacities
- Minimum concave cost flow over a grid network
- An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels
- Approximating some network design problems with node costs
- Supply chain design considering economies of scale and transport frequencies
- Decision horizons for the capacitated lot size model with inventory bounds and stockouts
- Extreme points and adjacency relationship in the flow polytope
- Lower bounds from state space relaxations for concave cost network flow problems
- Network flow problems and permutationally concave games
- The single-item lot-sizing problem with immediate lost sales
- Global and local search algorithms for concave cost transshipment problems
- Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
- Global search algorithms for minimum concave-cost network flow problems
- Valid inequalities for separable concave constraints with indicator variables
- Improved algorithms for dynamic lot sizing problems with incremental discount
- An application of interdependent lot size and consolidation point choice
- Forecast horizon for dynamic lot sizing model under product substitution and perishable inventories
- Efficient approximate algorithms for a class of dynamic lot size problems under product substitution
- A concave cost multimachine replacement problem with an expected breakthrough.
- A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
- On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems
- A single-item lot-sizing problem with a by-product and inventory capacities
- Multimodal transport network systems interface, interaction coordination: A specification for control systems integration
- scientific article; zbMATH DE number 3825543 (Why is no real title available?)
- A partitioning algorithm for the multicommodity network flow problem
- Multi-facility capacity expansion in R&D projects
This page was built for publication: Minimum Concave Cost Flows in Certain Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5545167)
