Cover Image

A general framework for providing interval representations of Pareto optimal outcomes for large-scale bi- and tri-criteria MIP problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Filcek, Grzegorz, Miroforidis, Janusz
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Strong bi-metric regularity in affine optimal control problems
by: Corella, Alberto Domínguez, et al.
Published: (2025)

Obtaining properly Pareto optimal solutions of multiobjective optimization problems via the branch and bound method
by: Wu, Weitian, et al.
Published: (2024)

Approximate solutions in multiobjective interval-valued optimization problems: Existence theorems and optimality conditions
by: Zhang, Chuang-liang, et al.
Published: (2025)

MIP Relaxations in Factorable Programming
by: He, Taotao, et al.
Published: (2023)

Open-loop Pareto-Nash equilibria in multi-objective interval differential games
by: Li, Wen, et al.
Published: (2024)

A convex variational principle for the necessary conditions of classical optimal control
by: Acharya, Amit, et al.
Published: (2025)

A line search framework with restarting for noisy optimization problems
by: Berahas, Albert S., et al.
Published: (2025)

QUBO Formulations for MIP Symmetry Detection
by: While, Alexander, et al.
Published: (2025)

Curse of scale-freeness: Intractability of large-scale optimization with multi-start methods
by: Masuyama, Hiroyuki, et al.
Published: (2022)

Two-stage stochastic algorithm for solving large-scale (non)-convex separable optimization problems under affine constraints
by: Dubois-Taine, Benjamin, et al.
Published: (2026)

A decomposition-based approach for large-scale pickup and delivery problems
by: Hiermann, G., et al.
Published: (2024)

A deterministic optimization algorithm for nonconvex and combinatorial bi-objective programming
by: Lee, Ye Seol, et al.
Published: (2024)

Solving the waste bin location problem with uncertain waste generation rate: a bi-objective robust optimization approach
by: Rossit, Diego, et al.
Published: (2024)

Second-order optimality conditions for optimization problems with generalized equation constraints
by: Benko, M., et al.
Published: (2026)

Gradient-based algorithms for multi-objective bi-level optimization
by: Yang, Xinmin, et al.
Published: (2024)

The bilinear Hessian for large scale optimization
by: Carlsson, Marcus, et al.
Published: (2025)

Benders decomposition for the large-scale probabilistic set covering problem
by: Liang, Jie, et al.
Published: (2025)

Decentralized non-convex optimization via bi-level SQP and ADMM
by: Stomberg, Gösta, et al.
Published: (2022)

Solving separable convex optimization problems: Faster prediction-correction framework
by: Zhang, Tao, et al.
Published: (2023)

Pareto-optimal treatment of uncertainties in model-based process design and operation
by: Schwientek, Jan, et al.
Published: (2025)

MIP-DD: A Delta Debugger for Mixed Integer Programming Solvers
by: Hoen, Alexander, et al.
Published: (2024)

A Hybrid Relaxation-Heuristic Framework for Solving MIP with Binary Variables
by: Wang, Zayn
Published: (2026)

New second-order optimality conditions for directional optimality of a general set-constrained optimization problem
by: Ouyang, Wei, et al.
Published: (2024)

A bi-level priority sorting framework for flexible AGV service scheduling in smart warehouses
by: Sun, Xiaozhu, et al.
Published: (2026)

Fast and memory-efficient optimization for large-scale data-driven predictive control
by: Schmitz, Philipp, et al.
Published: (2024)

Learn to formulate: A surrogate model framework for generalized assignment problem with routing constraints
by: Xue, Sen, et al.
Published: (2024)

Image Space Analysis to the generalized optimization problem on a local sphere
by: Zhou, Li-wen, et al.
Published: (2024)

Tight MIP Formulations for Optimal Operation and Investment of Storage Including Reserves
by: Elgersma, Maaike B., et al.
Published: (2024)

On MIP Formulations for Logit-Based Multi-Purchase Choice Models and Applications
by: He, Taotao, et al.
Published: (2026)

Data representation with optimal transport
by: Martín, Rocío Díaz, et al.
Published: (2024)

Sample-Cluster-Select: A new framework to obtain diverse approximate solutions of combinatorial optimization problems
by: Hashimoto, Susumu, et al.
Published: (2025)

Numerical solving of an optimal control problem in large time horizon: the aerial vehicle guidance
by: Askovic, Veljko, et al.
Published: (2025)

Towards large-scale probabilistic set covering problems: an efficient Benders decomposition approach
by: Lv, Wei, et al.
Published: (2024)

GeNIOS: an (almost) second-order operator-splitting solver for large-scale convex optimization
by: Diamandis, Theo, et al.
Published: (2023)

Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs
by: Hoen, Alexander, et al.
Published: (2024)

A parallel algorithm for generating Pareto-optimal radiosurgery treatment plans
by: da Silva, Joakim, et al.
Published: (2025)

A unified optimal control framework: time-optimal control and stochastic optimal control
by: Yang, Shuzhen
Published: (2025)

The large-scale charging scheduling problem for fleet batteries: Lagrangian decomposition with time-block reformulations
by: Fotedar, Sunney, et al.
Published: (2025)

Fix and Bound: An efficient approach for solving large-scale quadratic programming problems with box constraints
by: Locatelli, Marco, et al.
Published: (2022)

CMA Light: a novel Minibatch Algorithm for large-scale non convex finite sum optimization
by: Coppola, Corrado, et al.
Published: (2023)