We provide a comprehensive overview of the literature of algorithmic approaches for
multiobjective mixed‐integer and integer linear optimization problems. More precisely, we …

Multi-objective programming is commonly used in the literature when conflicted objectives
arise in solving optimization problems. Over the past decades, classical optimization …

Branch and bound is a well-known generic method for computing an optimal solution of a
single-objective optimization problem. Based on the idea “divide to conquer”, it consists in …

Multiobjective mixed integer convex optimization refers to mathematical programming
problems where more than one convex objective function needs to be optimized …

This paper presents a biobjective multiple allocation p-hub median problem, discusses the
properties of the Pareto frontier and proposes exact and heuristic algorithms for finding the …

This study analyzes an integrated inventory control and delivery scheduling problem in a
stochastic demand environment with economic and environmental considerations. In …

The survey highlights some of the research topics which have attracted attention in the last
two decades within the area of mathematical optimization of multiple objective functions. We …

Aggregate production planning (APP) that is an important concept of supply chain
management (SCM), is one of the tools to determine production rates, inventory levels, and …

End-use consumers (peers) are being empowered to aggregate for direct demand-side
participation through load scheduling and energy sharing. This is the result of the growth of …

Mixed-integer linear programming (MILP) has become a cornerstone of operations research.
This is driven by the enhanced efficiency of modern solvers, which can today find globally …