MIGP uses integer servings and goal deviations to produce feasible, practical meal plans that outperform post-hoc rounding of continuous solutions in 66% of cases while always succeeding.
An Exact Solution Approach for Portfolio Op- timization Problems Under Stochastic and Integer Constraints
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
representative citing papers
The Keplerian TSP models time-dependent interplanetary rendezvous missions as a discrete optimization problem using time-unfolding and ILP solvers, with released benchmarks and heuristics.
MLMC and MLQMC with h- and p-refinement hierarchies achieve significant speedups over standard MC for UQ in cantilever beam problems, with MLQMC showing optimal cost scaling under certain conditions.
citing papers explorer
-
Mixed Integer Goal Programming for Personalized Meal Optimization with User-Defined Serving Granularity
MIGP uses integer servings and goal deviations to produce feasible, practical meal plans that outperform post-hoc rounding of continuous solutions in 66% of cases while always succeeding.
-
The Keplerian Traveling Salesperson Problem
The Keplerian TSP models time-dependent interplanetary rendezvous missions as a discrete optimization problem using time-unfolding and ILP solvers, with released benchmarks and heuristics.
-
h- and p-refined Multilevel Monte Carlo Methods for Uncertainty Quantification in Structural Engineering
MLMC and MLQMC with h- and p-refinement hierarchies achieve significant speedups over standard MC for UQ in cantilever beam problems, with MLQMC showing optimal cost scaling under certain conditions.