Finding multiple solutions to general integer linear programs

DOI10.1016/j.ejor.2006.11.024zbMath1168.90562MaRDI QIDQ2384650

Jung-Fa Tsai, Ming-Hua Lin, Yi-Chung Hu

Publication date: 10 October 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.11.024

zbMATH Keywords

linearization; Integer programming; multiple solutions; general integer cut

Mathematics Subject Classification ID

90C10: Integer programming

Related Items

Finding multiple optimal solutions of signomial discrete programming problems with free variables

Uses Software

• MIPLIB
• LINDO
• AlphaECP
• LINGO

Cites Work

• Unnamed Item
• Unnamed Item
• An enumerative algorithm framework for a class of nonlinear integer programming problems
• An improved branch and bound algorithm for mixed integer nonlinear programs
• Solving mixed integer nonlinear programs by outer approximation
• A hybrid approach to resolving a differentiable integer program.
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Review of nonlinear mixed-integer and disjunctive programming techniques
• Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
• Fuzzy nonlinear programming for mixed-discrete design optimization through hybrid genetic algorithm
• A branch-and-cut method for 0-1 mixed convex programming
• Generalized Benders decomposition
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
• A tree-search algorithm for mixed integer programming problems
• Canonical Cuts on the Unit Hypercube
• Integrating SQP and branch-and-bound for mixed integer nonlinear programming