:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Rada, Miroslav, Hladík, Milan, Garajová, Elif Radová, Carrabs, Francesco, Cerulli, Raffaele, D'Ambrosio, Ciriaco
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control 90B18
Online Access:	https://arxiv.org/abs/2602.01360
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomial cases
by: Rada, Miroslav, et al.
Published: (2017)

Heuristics for the Worst Optimal Value of Interval Transportation Problems
by: Garajová, Elif Radová, et al.
Published: (2026)

Interval Linear Programming under Transformations: Optimal Solutions and Optimal Value Range
by: Garajová, Elif, et al.
Published: (2018)

Range of optimal values in absolute value linear programming with interval data
by: Hladík, Milan
Published: (2025)

Stability of the linear complementarity problem properties under interval uncertainty
by: Hladík, Milan
Published: (2019)

Linear programming sensitivity measured by the optimal value worst-case analysis
by: Hladík, Milan
Published: (2023)

A new polynomially solvable class of quadratic optimization problems with box constraints
by: Hladík, Milan, et al.
Published: (2019)

Properties of the solution set of absolute value equations and the related matrix classes
by: Hladík, Milan
Published: (2022)

Advanced Kernel Search approach for the MST Problem with conflicts involving affinity detection and initial solution construction
by: Carrabs, Francesco, et al.
Published: (2024)

Cutting planes for signomial programming
by: Xu, Liding, et al.
Published: (2022)

Adaptive first-order methods with enhanced worst-case rates
by: Florea, Mihai I.
Published: (2024)

Unbelievable $O(L^{1.5})$ worst case computational complexity achieved by $spdspds$ algorithm for linear programming problem
by: Halemane, Keshava Prasad
Published: (2014)

The logarithmic least squares priorities and ordinal violations in the best-worst method
by: Csató, László
Published: (2023)

Fixed Topology Minimum-Length Trees with Neighborhoods
by: Blanco, Víctor, et al.
Published: (2024)

Weighted Geometric Mean, Minimum Mediated Set, and Optimal Simple Second-Order Cone Representation
by: Wang, Jie
Published: (2022)

Formulations of the continuous set-covering problem on networks: a comparative study
by: Xu, Liding, et al.
Published: (2024)

Introducing Clause Cuts: Strong No-Good Cuts for MaxSAT Problems in Mixed Integer Linear Programming
by: Engelhardt, Max, et al.
Published: (2025)

On approximate Pareto solutions in nonsmooth interval-valued multiobjective optimization with data uncertainty in constraints
by: Quan, Vu Hong, et al.
Published: (2025)

Sparse decompositions of nonlinear dynamical systems and applications to moment-sum-of-squares relaxations
by: Schlosser, Corbinian, et al.
Published: (2020)

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
by: Tanınmış, Kübra, et al.
Published: (2023)

Worst-case complexity analysis of derivative-free methods for multi-objective optimization
by: Liuzzi, Giampaolo, et al.
Published: (2025)

A polynomially solvable case of unconstrained (-1,1)-quadratic fractional optimization
by: Yang, Meijia, et al.
Published: (2024)

Penalty decomposition derivative free method for the minimization of partially separable functions over a convex feasible set
by: Cecere, Francesco, et al.
Published: (2025)

Efficient Data-Driven Leverage Score Sampling Algorithm for the Minimum Volume Covering Ellipsoid Problem in Big Data
by: Harris, Elizabeth, et al.
Published: (2024)

Age of information cost minimization with no buffers, random arrivals and unreliable channels: A PCL-indexability analysis
by: Niño-Mora, José
Published: (2026)

An accelerated primal-dual flow for linearly constrained multiobjective optimization
by: Luo, Hao, et al.
Published: (2025)

On feasibility cuts for chance-constrained multicommodity network design problems
by: Wouda, Niels A., et al.
Published: (2024)

Worst case complexity bounds for linesearch-type derivative-free algorithms
by: Brilli, Andrea, et al.
Published: (2023)

Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server
by: Druetto, Alessandro, et al.
Published: (2024)

How to measure the uncertainty of a tournament draw: The case of European football's Champions League
by: Csató, László, et al.
Published: (2025)

Iteration Complexity of Frank-Wolfe and Its Variants for Bilevel Optimization
by: Palmieri, Anthony, et al.
Published: (2026)

Underground Freight Transportation for Package Delivery in Urban Environments
by: Powell, Sarah, et al.
Published: (2024)

Difference of Convex (DC) approach for neural network approximation with uniform loss function
by: Peiris, Vinesha, et al.
Published: (2026)

Quadratic optimal transportation problem with a positive semi definite structure on the cost function
by: Jeong, Seonghyeon
Published: (2024)

How to optimise tournament draws: The case of the FIFA World Cup
by: Csató, László
Published: (2025)

A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
by: Nishioka, Akatsuki, et al.
Published: (2023)

Bundle methods with quadratic cuts for deterministic and stochastic strongly convex optimization problems
by: Guigues, Vincent, et al.
Published: (2017)

On a minimization problem of the maximum generalized eigenvalue: properties and algorithms
by: Nishioka, Akatsuki, et al.
Published: (2023)

Minimizing and Maximizing the Shannon Entropy for Fixed Marginals
by: Franke, Paula, et al.
Published: (2025)

A New Linear Programming Approach and a New Backtracking Strategy for Multiple-Gradient Descent in Multi-Objective Optimization
by: Della Santa, Francesco
Published: (2024)