:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Wang, Xintong, Chen, Liang, Dai, Yu-Hong
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control
Accesso online:	https://arxiv.org/abs/2602.22640
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

The colored knapsack problem: structural properties and exact algorithms
di: Ciccarelli, Fabio, et al.
Pubblicazione: (2026)

An efficient branch-and-cut approach for the sequential competitive facility location problem under partially binary rule
di: Guo, Yu-Qi, et al.
Pubblicazione: (2025)

On the sequential convergence of Lloyd's algorithms
di: Portales, Léo, et al.
Pubblicazione: (2024)

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

Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem
di: Kim, Junyoung, et al.
Pubblicazione: (2024)

On strong valid inequalities for a class of mixed-integer nonlinear sets with box constraints
di: Li, Keyan, et al.
Pubblicazione: (2026)

Polyhedral results for two classes of submodular sets with GUB constraints
di: Qian, Weikang, et al.
Pubblicazione: (2026)

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

Parallel Newton methods for the continuous quadratic knapsack problem: A Jacobi and Gauss-Seidel tale
di: Secchin, Leonardo D., et al.
Pubblicazione: (2026)

An exact column generation algorithm for load balancing in capacity sharing networks
di: Hu, Kaixiang, et al.
Pubblicazione: (2024)

An exact algorithm for vehicle routing problems with temporal dependency constraints
di: van Montfort, Loek, et al.
Pubblicazione: (2026)

Solving a large oral examination timetabling problem using a multidimensional knapsack MILP formulation
di: Briand, Cyrille, et al.
Pubblicazione: (2026)

A scalable sequential adaptive cubic regularization algorithm for optimization with general equality constraints
di: Pei, Yonggang, et al.
Pubblicazione: (2025)

An exact pricing algorithm for revenue maximization under the logit demand function
di: Nayeem, Moddassir Khan, et al.
Pubblicazione: (2025)

On contention resolution for the hypergraph matching, knapsack, and $k$-column sparse packing problems
di: Sergeev, Ivan
Pubblicazione: (2024)

An Efficient Stochastic Subgradient Method for the Global Placement Problem in Very Large-Scale Integration Circuits
di: Yue, Yi-Shuang, et al.
Pubblicazione: (2024)

On disjunction convex hulls by lifting
di: Qu, Yushan, et al.
Pubblicazione: (2024)

A Dynamic Relaxation Framework for Global Solution of ACOPF
di: Tang, Yu-Yang, et al.
Pubblicazione: (2025)

A rounding and clustering-based exact algorithm for the p-center problem
di: Ales, Zacharie, et al.
Pubblicazione: (2024)

Ordering and refining path-complete Lyapunov functions through composition lifts
di: Jongeneel, Wouter, et al.
Pubblicazione: (2025)

On the strength of Burer's lifted convex relaxation to quadratic programming with ball constraints
di: Kılınç-Karzan, Fatma, et al.
Pubblicazione: (2024)

Asset liability management under sequential stochastic dominance constraints
di: Consigli, Giorgio, et al.
Pubblicazione: (2025)

A sequential linear complementarity problem method for generalized Nash equilibrium problems
di: Diao, Ruoyu, et al.
Pubblicazione: (2026)

A generic Branch-and-Cut algorithm for bi-objective binary linear programs
di: Fouilhoux, Pierre, et al.
Pubblicazione: (2024)

Enhanced Barrier-Smoothing Technique for Bilevel Optimization with Nonsmooth Mappings
di: Xu, Mengwei, et al.
Pubblicazione: (2024)

A novel exact approach to polynomial optimization
di: Bertsimas, Dimitris, et al.
Pubblicazione: (2025)

Decentralized online stochastic generalized Nash Equilibrium seeking for multi-cluster games: A Byzantine-resilient algorithm
di: Liu, Bingqian, et al.
Pubblicazione: (2025)

Branching with a pre-specified finite list of $k$-sparse split sets for binary MILPs
di: Dey, Santanu S., et al.
Pubblicazione: (2024)

A mechanism of three-dimensional quadratic termination for the gradient method with applications
di: Huang, Yakui, et al.
Pubblicazione: (2022)

A strong second-order sequential optimality condition for nonlinear programming problems
di: Li, Huimin, et al.
Pubblicazione: (2025)

Approximation and exact penalization in simple bilevel variational problems
di: Bigi, Giancarlo, et al.
Pubblicazione: (2025)

Geometry of exactness of moment-SOS relaxations for polynomial optimization
di: Henrion, Didier
Pubblicazione: (2023)

A column generation approach to exact experimental design
di: Ahipasaoglu, Selin, et al.
Pubblicazione: (2025)

Rank conditions for exactness of semidefinite relaxations in polynomial optimization
di: Lasserre, Jean B
Pubblicazione: (2025)

ODE approximation for the Adam algorithm: General and overparametrized setting
di: Dereich, Steffen, et al.
Pubblicazione: (2025)

Presolving and cutting planes for the generalized maximal covering location problem
di: Lv, Wei, et al.
Pubblicazione: (2024)

Flexibility allocation in random bipartite matching markets: exact matching rates and dominance regimes
di: Ameen, Taha, et al.
Pubblicazione: (2026)

A 2-approximation algorithm for the softwired parsimony problem on binary, tree-child phylogenetic networks
di: Frohn, Martin, et al.
Pubblicazione: (2024)

A combinatorial approach to Ramana's exact dual for semidefinite programming
di: Pataki, Gabor
Pubblicazione: (2025)

Positively not SOS: pseudo-moments and extreme rays in exact arithmetic
di: Henrion, Didier
Pubblicazione: (2025)