A DC Programming Approach for Mixed-Integer Linear Programs
From MaRDI portal
Publication:3627700
DOI10.1007/978-3-540-87477-5_27zbMath1160.90604OpenAlexW2102759068MaRDI QIDQ3627700
Publication date: 13 May 2009
Published in: Communications in Computer and Information Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87477-5_27
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (8)
DC Programming Approaches for BMI and QMI Feasibility Problems ⋮ Discrete dynamical system approaches for Boolean polynomial optimization ⋮ An efficient DC programming approach for portfolio decision with higher moments ⋮ A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program ⋮ A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model ⋮ A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques ⋮ Continuous relaxation for discrete DC programming ⋮ A DC Programming Approach for Mixed-Integer Linear Programs
Uses Software
Cites Work
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- A continuous approach to nonlinear integer programming
- A DC Programming Approach for Mixed-Integer Linear Programs
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Unnamed Item
- Unnamed Item
This page was built for publication: A DC Programming Approach for Mixed-Integer Linear Programs