Pages that link to "Item:Q948649"

The following pages link to Nonconvex piecewise linear knapsack problems (Q948649):

Displaying 11 items.

• A branch-cut-and-price algorithm for the piecewise linear transportation problem (Q319653) (← links)
• A graphical approach to solve an investment optimization problem (Q483269) (← links)
• A new effective dynamic program for an investment optimization problem (Q505320) (← links)
• Heuristic algorithms for the general nonlinear separable knapsack problem (Q709196) (← links)
• Optimal pricing in iterative flexible combinatorial procurement auctions (Q1740561) (← links)
• A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) (Q1761954) (← links)
• Linearization technique with superior expressions for centralized planning problem with discount policy (Q2137652) (← links)
• Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization (Q2356258) (← links)
• Capacitated refueling station location problem with traffic deviations over multiple time periods (Q2358103) (← links)
• A parametric simplex algorithm for biobjective piecewise linear programming problems (Q2628166) (← links)
• Approximating single- and multi-objective nonlinear sum and product knapsack problems (Q6108919) (← links)