An intelligent algorithm for mixed-integer programming models

DOI10.1016/0305-0548(92)90001-LMaRDI QIDQ1206379zbMATH OpenOpenAlexFDO

Authors Youling Lin, Larry M. Austin, James R. Burns

Publication date 1 April 1993

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0305-0548(92)90001-l

zbMATH Keywords

branch-and-bound algorithmneural networkmixed integer linear programming

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Neural networks for/in biological studies, artificial life and related topics (92B20) Mixed integer programming (90C11)

Recommendations

• An implicit branch-and-bound algorithm for mixed-integer linear programming
• Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The <scp>zoom</scp> System
• The reduced cost branch and bound algorithm for mixed integer programming
• Technical Note—An Improved Branch-and-Bound Method for Integer Programming
• On learning and branching: a survey

Cites work

• scientific article; zbMATH DE number 193499 (Why is no real title available?)
• A Rapidly Convergent Descent Method for Minimization
• A primal-dual cutting-plane algorithm for all-integer programming
• A tree-search algorithm for mixed integer programming problems
• An Automatic Method of Solving Discrete Programming Problems
• An advanced dual algorithm with constraint relaxation for all-integer programming
• An advanced start algorithm for all-integer programming
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• An implicit branch-and-bound algorithm for mixed-integer linear programming
• An interactive method for bicriteria integer programming
• An interior point algorithm to solve computationally difficult set covering problems
• Computational experience with an interior point algorithm on the satisfiability problem
• Function minimization by conjugate gradients
• Integer Linear Programming: A Study in Computational Efficiency
• Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
• Letter to the Editor—An Experimental Investigation and Comparative Evaluation of Flow-Shop Scheduling Techniques
• Nonlinear Programming by the Simplex Method
• On the stability of the travelling salesman problem algorithm of Hopfield and Tank
• Scheduling with Multiple Performance Measures: The One-Machine Case
• The mixed cutting plane algorithm for all-integer programming
• Variance algorithm for minimization
• ``Neural computation of decisions in optimization problems

Cited in

(9)

• On learning and branching: a survey
• Future paths for integer programming and links to artificial intelligence
• Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The <scp>zoom</scp> System
• A mixed-integer programming approach to GRNN parameter estimation
• Efficient intelligent backtracking using linear programming
• Genetic Programming
• An Algorithm Model for Mixed Variable Programming
• Predicting the solution time of branch-and-bound algorithms for mixed-integer programs
• An approach for the optimal solution of MILP problems

This page was built for publication: An intelligent algorithm for mixed-integer programming models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1206379)