Pages that link to "Item:Q1854755"

The following pages link to Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach (Q1854755):

Displaying 18 items.

• Cost-based decision-making in middleware virtualization environments (Q531466) (← links)
• On interval-subgradient and no-good cuts (Q613320) (← links)
• Transshipment service through crossdocks with both soft and hard time windows (Q763197) (← links)
• Approximated consistency for the automatic recording constraint (Q1010285) (← links)
• Constraint programming and operations research (Q1616390) (← links)
• Solving fixed charge transportation problem with truck load constraint using metaheuristics (Q1730658) (← links)
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
• A deterministic annealing algorithm for the minimum concave cost network flow problem (Q1952548) (← links)
• Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems (Q2267294) (← links)
• Optimization models for forest road upgrade planning (Q2369960) (← links)
• Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements (Q2468776) (← links)
• Lower bounds from state space relaxations for concave cost network flow problems (Q2494472) (← links)
• A branch-and-bound algorithm for concave network flow problems (Q2494473) (← links)
• A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087) (← links)
• Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling (Q2676319) (← links)
• Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem (Q2926472) (← links)
• Logic-based MultiObjective Optimization for Restoration Planning (Q3638509) (← links)
• Minimum‐cost flow problems having arc‐activation costs (Q6077360) (← links)