Pages that link to "Item:Q4170534"

The following pages link to A hybrid approach to discrete mathematical programming (Q4170534):

Displaying 38 items.

• Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
• Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems. (Q703298) (← links)
• An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint (Q706934) (← links)
• Dual variable based fathoming in dynamic programs for column generation (Q707137) (← links)
• A critical review of discrete filled function methods in solving nonlinear discrete optimization problems (Q708127) (← links)
• Truck scheduling at zero-inventory cross docking terminals (Q733516) (← links)
• Parameterisation algorithms for the integer linear programs in binary variables (Q795729) (← links)
• Exact algorithm for concave knapsack problems: linear underestimation and partition method (Q811881) (← links)
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
• A solution procedure for general knapsack problems with a few constraints (Q908852) (← links)
• Generalized dynamic programming for multicriteria optimization (Q908857) (← links)
• Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
• Sequencing mixed-model assembly lines to minimize part inventory cost (Q991825) (← links)
• Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
• A hybrid method for solving nonlinear knapsack problems (Q1123129) (← links)
• Multicriteria dynamic programming with an application to the integer case (Q1158349) (← links)
• Parametric integer linear programming: A synthesis of branch and bound with cutting planes (Q1162446) (← links)
• An interactive dynamic programming approach to multicriteria discrete programming (Q1169938) (← links)
• Heuristics and exact algorithms for solving the Monden problem (Q1266568) (← links)
• A branch and bound algorithm for solving separable convex integer programming problems (Q1342308) (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
• Smart greedy procedure for solving a multidimensional nonlinear knapsack class of reliability optimization problems. (Q1597095) (← links)
• Dispersion with connectivity in wireless mesh networks (Q1716989) (← links)
• A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem (Q1894383) (← links)
• A nonlinear knapsack problem (Q1905070) (← links)
• Smart greedy procedure for solving a nonlinear knapsack class of reliability optimization problems (Q1905883) (← links)
• Scheduling inbound and outbound trucks at cross docking terminals (Q2267379) (← links)
• Scheduling just-in-time part supply for mixed-model assembly lines (Q2275595) (← links)
• A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
• Multicriteria integer programming: A (hybrid) dynamic programming recursive approach (Q3948895) (← links)
• An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions (Q3960473) (← links)
• (Q5021865) (← links)
• A new exact algorithm for concave knapsack problems with integer variables (Q5031798) (← links)
• An efficient algorithm for multi-dimensional nonlinear knapsack problems (Q5423360) (← links)
• Surrogate dual method for multi-dimensional nonlinear knapsack problems (Q5456301) (← links)
• An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems (Q5481688) (← links)
• A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables (Q6043104) (← links)
• A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)