An extended cutting plane method for solving convex MINLP problems

1995/06/01 by Tapio Westerlund, Frank Pettersson · 3 citations
Computer Science · Engineering · Mathematics · #Advanced Multi-Objective Optimization Algorithms #Advanced Optimization Algorithms Research #Optimization and Mathematical Programming

paper · doi:10.1016/0098-1354(95)87027-x

openalex publication_date 1995/06/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/26

Citations

• Generalized Benders decomposition
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs

Cited by

• Assignment-Routing Optimization: Solvers for Problems Under Constraints
• Assignment-Routing Optimization with Cutting-Plane Subtour Elimination: Solver and Benchmark Dataset
• Warm-starting outer approximation for parametrized convex MINLP