:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Bencheikh, Ali, Moulai, Mustapha, Badaoui, Ilies
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 90C29, 90C10, 90C20, 90C32, 90C57
Online Access:	https://arxiv.org/abs/2402.01310
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Bi-Objective Optimization Based Acquisition Strategy for Batch Bayesian Global Optimization
by: Carciaghi, Francesco, et al.
Published: (2024)

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

Linear Decision Tree Policies for Integer Linear Programs
by: Guyard, Théo, et al.
Published: (2026)

Cardinality-Constrained Multi-Objective Optimization: Novel Optimality Conditions and Algorithms
by: Lapucci, Matteo, et al.
Published: (2023)

Characterization of Highly Robust Solutions in Multi-Objective Programming in Banach Spaces
by: Rahimi, Morteza, et al.
Published: (2025)

A Non-Archimedean Interior Point Method for Solving Lexicographic Multi-Objective Quadratic Programming Problems
by: Fiaschi, Lorenzo, et al.
Published: (2021)

Solving Cutting Stock Problems via an Extended Ryan-Foster Branching Scheme and Fast Column Generation
by: da Silva, Renan F. F., et al.
Published: (2023)

Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms
by: Bestuzheva, Ksenia, et al.
Published: (2022)

A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization
by: Mansueto, Pierluigi
Published: (2025)

Low-Rank Multi-Objective Linear Programming
by: Löhne, Andreas, et al.
Published: (2025)

Implied Integrality in Mixed-Integer Optimization
by: van der Hulst, Rolf, et al.
Published: (2025)

New results on the local-nonglobal minimizers of the generalized trust-region subproblem
by: Ai, Wenbao, et al.
Published: (2024)

On the Relationship Between the Value Function and the Efficient Frontier of a Mixed Integer Linear Optimization Problem
by: Fallah, Samira, et al.
Published: (2023)

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

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

Damage Location in Mechanical Structures by Multi-Objective Pattern Search
by: Günther, Christian, et al.
Published: (2024)

Generalizations of Total Dual Integrality
by: Guenin, Bertrand, et al.
Published: (2025)

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
by: Dörfler, Daniel, et al.
Published: (2020)

Optimality Conditions and Duality for Multiobjective Fractional Bilevel Optimization Problems
by: Lara, Felipe, et al.
Published: (2025)

Process-Based Lagrange Multipliers for Nonconvex Set-Valued Optimization
by: García-Castaño, Fernando, et al.
Published: (2026)

On the Convexity of the Solution Set of Linear Complementarity Problem over Tensor Spaces
by: Sharma, Sonali, et al.
Published: (2026)

Conductance Estimation in Digraphs: Submodular Transformation, Lovász Extension and Dinkelbach Iteration
by: Shao, Sihong, et al.
Published: (2025)

A Set-Valued Lagrange Theorem based on a Process for Convex Vector Programming
by: García-Castaño, Fernando, et al.
Published: (2024)

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
by: Borges, Jennifer C., et al.
Published: (2026)

Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm
by: De Santis, Marianna, et al.
Published: (2026)

Lagrange Multipliers, Duality, and Sensitivity in Set-Valued Convex Programming via Pointed Closed Convex Processes
by: García-Castaño, Fernando, et al.
Published: (2024)

Equitable Routing--Rethinking the Multiple Traveling Salesman Problem
by: Bhadoriya, Abhay Singh, et al.
Published: (2024)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
by: Kojima, Masakazu, et al.
Published: (2025)

Beyond binarity: Semidefinite programming for ternary quadratic problems
by: de Meijer, Frank, et al.
Published: (2026)

An Exceptionally Difficult Binary Quadratic Optimization Problem with Symmetry: a Challenge for The Largest Unsolved QAP Instance Tai256c
by: Fujii, Koichi, et al.
Published: (2023)

A Solution Concept for Convex Vector Optimization Problems based on a User-defined Region of Interest
by: Dörfler, Daniel, et al.
Published: (2026)

Symmetric and Non-Symmetric Cone Separation via Bishop-Phelps Cones in Normed Spaces
by: García-Castaño, Fernando, et al.
Published: (2025)

Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
by: Gómez-Casares, Ignacio, et al.
Published: (2025)

Sublinear Scalarizations for Proper and Approximate Proper Efficient Points in Nonconvex Vector Optimization
by: García-Castaño, Fernando, et al.
Published: (2024)

Deriving Priorities From Inconsistent PCM using the Network Algorithms
by: Anholcer, Marcin, et al.
Published: (2015)

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
by: Qu, Zheng, et al.
Published: (2023)

A Subspace Minimization Barzilai-Borwein Method for Multiobjective Optimization Problems
by: Chen, Jian, et al.
Published: (2024)

A Decision-Making Method in Polyhedral Convex Set Optimization
by: Löhne, Andreas
Published: (2024)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
by: Arima, Naohiko, et al.
Published: (2023)

On the Computation of the Efficient Frontier in Advanced Sparse Portfolio Optimization
by: Annunziata, Arturo, et al.
Published: (2025)