Pages that link to "Item:Q2468881"
From MaRDI portal
The following pages link to A bilinear relaxation based algorithm for concave piecewise linear network flow problems (Q2468881):
Displaying 15 items.
- Degeneracy removal in cutting plane methods for disjoint bilinear programming (Q519763) (← links)
- Bilinear modeling solution approach for fixed charge network flow problems (Q839798) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Simplifying the nonlinear continuous time-cost tradeoff problem (Q1697748) (← links)
- Computational risk management techniques for fixed charge network flow problems with uncertain arc failures (Q1945698) (← links)
- A simplex algorithm for network flow problems with piecewise linear fractional objective function (Q1956474) (← links)
- Double-row facility layout with replicate machines and split flows (Q2003412) (← links)
- Convexification of bilinear forms through non-symmetric lifting (Q2045010) (← links)
- A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design (Q2114828) (← links)
- A polynomial local optimality condition for the concave piecewise linear network flow problem (Q2146593) (← links)
- A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems (Q2459395) (← links)
- Adaptive dynamic cost updating procedure for solving fixed charge network flow problems (Q2479831) (← links)
- Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems (Q4488862) (← links)
- BILINEAR PROGRAMMING FORMULATIONS FOR WEBER PROBLEMS WITH CONTINUOUS AND NETWORK DISTANCES (Q5694062) (← links)
- A sequential reduction algorithm for the large-scale fixed-charge network flow problems (Q6542455) (← links)
