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