Pages that link to "Item:Q2479831"

The following pages link to Adaptive dynamic cost updating procedure for solving fixed charge network flow problems (Q2479831):

Displaying 8 items.

• Solving dynamic public insurance games with endogenous agent distributions: theory and computational approximation (Q298374) (← links)
• A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks (Q360513) (← links)
• A heuristic method for the minimum toll booth problem (Q604959) (← links)
• Bilinear modeling solution approach for fixed charge network flow problems (Q839798) (← links)
• Computational risk management techniques for fixed charge network flow problems with uncertain arc failures (Q1945698) (← links)
• An augmented Lagrangian based semismooth Newton method for a class of bilinear programming problems (Q2181561) (← links)
• A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems (Q2459395) (← links)
• Minimum‐cost flow problems having arc‐activation costs (Q6077360) (← links)