The multidimensional 0–1 knapsack problem is one of the most well-known integer
programming problems and has received wide attention from the operational research …

This work presents a review of the main deterministic mixed‐integer nonlinear programming
(MINLP) solution methods for problems with convex and nonconvex functions. An overview …

The SCIP Optimization Suite provides a collection of software packages for mathematical
optimization centered around the constraint integer programming framework SCIP. This …

This article describes new features and enhanced algorithms made available in version 5.0
of the SCIP Optimization Suite. In its central component, the constraint integer programming …

Many optimal decision problems in scientific, engineering, and public sector applications
involve both discrete decisions and nonlinear system dynamics that affect the quality of the …

Faced with the challenge of solving hard optimization problems that abound in the real
world, classical methods often encounter great difficulty. Vitally important applications in …

A PRACTICAL GUIDE TO OPTIMIZATION PROBLEMS WITH DISCRETE OR INTEGER
VARIABLES, REVISED AND UPDATED The revised second edition of Integer Programming …

This paper describes the extensions that were added to the constraint integer programming
framework SCIP in order to enable it to solve convex and nonconvex mixed-integer …

Constraint integer programming (CIP) is a novel paradigm which integrates constraint
programming (CP), mixed integer programming (MIP), and satisfiability (SAT) modeling and …

An accessible treatment of the modeling and solution of integer programming problems,
featuring modern applications and software In order to fully comprehend the algorithms …