A hybrid approach to discrete mathematical programming

DOI10.1007/BF01588949zbMath0388.90055MaRDI QIDQ4170534

Thomas L. Morin, Roy E. Marsten

Publication date: 1978

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C10: Integer programming

90C05: Linear programming

90C39: Dynamic programming

Related Items

An efficient algorithm for multi-dimensional nonlinear knapsack problems, Surrogate dual method for multi-dimensional nonlinear knapsack problems, An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems, Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems., An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint, Dual variable based fathoming in dynamic programs for column generation, A critical review of discrete filled function methods in solving nonlinear discrete optimization problems, Truck scheduling at zero-inventory cross docking terminals, Parameterisation algorithms for the integer linear programs in binary variables, Exact algorithm for concave knapsack problems: linear underestimation and partition method, The multidimensional 0-1 knapsack problem -- bounds and computational aspects, A solution procedure for general knapsack problems with a few constraints, Generalized dynamic programming for multicriteria optimization, Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method, Sequencing mixed-model assembly lines to minimize part inventory cost, Convergent Lagrangian and domain cut method for nonlinear knapsack problems, A hybrid method for solving nonlinear knapsack problems, Multicriteria dynamic programming with an application to the integer case, Parametric integer linear programming: A synthesis of branch and bound with cutting planes, An interactive dynamic programming approach to multicriteria discrete programming, Heuristics and exact algorithms for solving the Monden problem, A branch and bound algorithm for solving separable convex integer programming problems, The multidimensional 0-1 knapsack problem: an overview., Smart greedy procedure for solving a multidimensional nonlinear knapsack class of reliability optimization problems., A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem, A nonlinear knapsack problem, Smart greedy procedure for solving a nonlinear knapsack class of reliability optimization problems, Scheduling inbound and outbound trucks at cross docking terminals, A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem, Multicriteria integer programming: A (hybrid) dynamic programming recursive approach, An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions

Cites Work

• Unnamed Item
• Unnamed Item
• The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions
• Combined use of dynamic programming and branch-and-bound methods in discrete-programming problems
• A generalized permanent label setting algorithm for the shortest path between specified nodes
• Discrete Dynamic Programming and Capital Allocation
• The knapsack problem: A survey
• When the Greedy Solution Solves a Class of Knapsack Problems
• A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• Merging and Sorting Applied to the Zero-One Knapsack Problem
• Branch-and-Bound Strategies for Dynamic Programming
• A dual algorithm for the one-machine scheduling problem
• The Power of Dominance Relations in Branch-and-Bound Algorithms
• An Algorithm for Nonlinear Knapsack Problems
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey