A parallel difference-of-convex cutting plane algorithm for mixed-binary linear programs
From MaRDI portal
Cites work
- A constraints-aware reweighted feasibility pump approach
- A continuous approch for globally solving linearly constrained quadratic
- A Cutting-Plane Game for Facial Disjunctive Programs
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A DC Programming Approach for Mixed-Integer Linear Programs
- A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A storm of feasibility pumps for nonconvex MINLP
- BARON: A general purpose global optimization software package
- Branching and bounds tighteningtechniques for non-convex MINLP
- Computing B-stationary points of nonsmooth DC programs
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Cutting planes in integer and mixed integer programming
- DC programming and DCA: thirty years of developments
- DC Programming Approaches for BMI and QMI Feasibility Problems
- DC programming approaches for discrete portfolio optimization under concave transaction costs
- Discrete dynamical system approaches for Boolean polynomial optimization
- Exact penalty and error bounds in DC programming
- Exact penalty in d. c. programming
- scientific article; zbMATH DE number 4041643 (Why is no real title available?)
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
- On a linear-programming, combinatorial approach to the traveling-salesman problem
- On interval-subgradient and no-good cuts
- Outline of an algorithm for integer solutions to linear programs
- Partitioning procedures for solving mixed-variables programming problems
- Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA
- Reducibility among combinatorial problems
- SCIP: solving constraint integer programs
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming
- Solution of a Large-Scale Traveling-Salesman Problem
- Solving the earliness tardiness scheduling problem by DC programming and DCA
- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA
- Solving zero-one mixed integer programming problems using tabu search
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Three ideas for a feasibility pump for nonconvex MINLP
- Valid inequalities for mixed integer linear programs
This page was built for publication: A parallel difference-of-convex cutting plane algorithm for mixed-binary linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7391953)
