A hybrid approach to resolving a differentiable integer program.

DOI10.1016/S0305-0548(97)00088-9zbMath1042.90593OpenAlexW1972519456MaRDI QIDQ1406652

Hsiao-Fan Wang, Yi-Chun Liao

Publication date: 7 September 2003

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

Full work available at URL: https://doi.org/10.1016/s0305-0548(97)00088-9

zbMATH Keywords

Genetic algorithmsInteger programmingApproximation theoryProblem solvingConstraint theoryDifferentiable integer programming problemsDifferentiation (calculus)

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Finding multiple solutions to general integer linear programs ⋮ Fuzzy non-linear integer program by parametric programming approach

Cites Work

• Unnamed Item
• Unnamed Item
• Lagrangean decomposition for integer nonlinear programming with linear constraints
• An Automatic Method of Solving Discrete Programming Problems
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Mixed-integer quadratic programming
• Branch and Bound Methods for Mathematical Programming Systems
• Branch-and-Bound Methods: A Survey
• Quadratic Binary Programming with Application to Capital-Budgeting Problems
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• A Balasian-Based Algorithm for Zero-One Polynomial Programming
• An approximate algorithm for nonlinear integer programming

This page was built for publication: A hybrid approach to resolving a differentiable integer program.