Pages that link to "Item:Q4367015"

The following pages link to New formulation and relaxation to solve a concave-cost network flow problem (Q4367015):

Displaying 21 items.

• Minimal-cost network flow problems with variable lower bounds on arc flows (Q632657) (← links)
• A conic quadratic formulation for a class of convex congestion functions in network flow problems (Q713098) (← links)
• Network optimization with piecewise linear convex costs (Q971452) (← links)
• The interactive fixed charge inhomogeneous flows optimization problem (Q1173721) (← links)
• The design of service systems with queueing time cost, workload capacities and backup service (Q1291646) (← links)
• Solution procedures for the service system design problem (Q1361393) (← links)
• Network cost minimization using threshold-based discounting (Q1600844) (← links)
• On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization (Q1686496) (← links)
• A concave link elimination (CLE) procedure and lower bound for concave topology, capacity and flow assignment network design problems (Q1854815) (← links)
• Coordination game analysis through penalty scheme in freight intermodal service (Q1954571) (← links)
• A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations (Q2275582) (← links)
• A bilinear relaxation based algorithm for concave piecewise linear network flow problems (Q2468881) (← links)
• Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths (Q2469589) (← links)
• Best routes selection in international intermodal networks (Q2475845) (← links)
• Modeling and solving a multimodal transportation problem with flexible-time and scheduled services (Q3076017) (← links)
• Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs (Q3392064) (← links)
• A composite algorithm for a concave-cost network flow problem (Q3827773) (← links)
• Single‐warehouse multi‐retailer inventory systems with full truckload shipments (Q5187943) (← links)
• The multi-hour service system design problem (Q5925868) (← links)
• The plant location and flexible technology acquisition problem. (Q5953331) (← links)
• Fast heuristics for the time-constrained immobile server problem (Q6659813) (← links)