Image de couverture de livre

Efficient exact sequential lifting algorithm for binary knapsack set

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Wang, Xintong, Chen, Liang, Dai, Yu-Hong
Format:	Preprint
Publié:	2026
Sujets:	Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The colored knapsack problem: structural properties and exact algorithms
par: Ciccarelli, Fabio, et autres
Publié: (2026)

An efficient branch-and-cut approach for the sequential competitive facility location problem under partially binary rule
par: Guo, Yu-Qi, et autres
Publié: (2025)

On the sequential convergence of Lloyd's algorithms
par: Portales, Léo, et autres
Publié: (2024)

Benders decomposition for the large-scale probabilistic set covering problem
par: Liang, Jie, et autres
Publié: (2025)

On strong valid inequalities for a class of mixed-integer nonlinear sets with box constraints
par: Li, Keyan, et autres
Publié: (2026)

Polyhedral results for two classes of submodular sets with GUB constraints
par: Qian, Weikang, et autres
Publié: (2026)

Towards large-scale probabilistic set covering problems: an efficient Benders decomposition approach
par: Lv, Wei, et autres
Publié: (2024)

Parallel Newton methods for the continuous quadratic knapsack problem: A Jacobi and Gauss-Seidel tale
par: Secchin, Leonardo D., et autres
Publié: (2026)

An exact algorithm for vehicle routing problems with temporal dependency constraints
par: van Montfort, Loek, et autres
Publié: (2026)

Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem
par: Kim, Junyoung, et autres
Publié: (2024)

An exact column generation algorithm for load balancing in capacity sharing networks
par: Hu, Kaixiang, et autres
Publié: (2024)

Solving a large oral examination timetabling problem using a multidimensional knapsack MILP formulation
par: Briand, Cyrille, et autres
Publié: (2026)

A scalable sequential adaptive cubic regularization algorithm for optimization with general equality constraints
par: Pei, Yonggang, et autres
Publié: (2025)

An exact pricing algorithm for revenue maximization under the logit demand function
par: Nayeem, Moddassir Khan, et autres
Publié: (2025)

An Efficient Stochastic Subgradient Method for the Global Placement Problem in Very Large-Scale Integration Circuits
par: Yue, Yi-Shuang, et autres
Publié: (2024)

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

On disjunction convex hulls by lifting
par: Qu, Yushan, et autres
Publié: (2024)

A Dynamic Relaxation Framework for Global Solution of ACOPF
par: Tang, Yu-Yang, et autres
Publié: (2025)

A rounding and clustering-based exact algorithm for the p-center problem
par: Ales, Zacharie, et autres
Publié: (2024)

Ordering and refining path-complete Lyapunov functions through composition lifts
par: Jongeneel, Wouter, et autres
Publié: (2025)

On the strength of Burer's lifted convex relaxation to quadratic programming with ball constraints
par: Kılınç-Karzan, Fatma, et autres
Publié: (2024)

Asset liability management under sequential stochastic dominance constraints
par: Consigli, Giorgio, et autres
Publié: (2025)

A novel exact approach to polynomial optimization
par: Bertsimas, Dimitris, et autres
Publié: (2025)

Decentralized online stochastic generalized Nash Equilibrium seeking for multi-cluster games: A Byzantine-resilient algorithm
par: Liu, Bingqian, et autres
Publié: (2025)

Enhanced Barrier-Smoothing Technique for Bilevel Optimization with Nonsmooth Mappings
par: Xu, Mengwei, et autres
Publié: (2024)

Branching with a pre-specified finite list of $k$-sparse split sets for binary MILPs
par: Dey, Santanu S., et autres
Publié: (2024)

A strong second-order sequential optimality condition for nonlinear programming problems
par: Li, Huimin, et autres
Publié: (2025)

A generic Branch-and-Cut algorithm for bi-objective binary linear programs
par: Fouilhoux, Pierre, et autres
Publié: (2024)

Approximation and exact penalization in simple bilevel variational problems
par: Bigi, Giancarlo, et autres
Publié: (2025)

Geometry of exactness of moment-SOS relaxations for polynomial optimization
par: Henrion, Didier
Publié: (2023)

A column generation approach to exact experimental design
par: Ahipasaoglu, Selin, et autres
Publié: (2025)

Rank conditions for exactness of semidefinite relaxations in polynomial optimization
par: Lasserre, Jean B
Publié: (2025)

A mechanism of three-dimensional quadratic termination for the gradient method with applications
par: Huang, Yakui, et autres
Publié: (2022)

A combinatorial approach to Ramana's exact dual for semidefinite programming
par: Pataki, Gabor
Publié: (2025)

Positively not SOS: pseudo-moments and extreme rays in exact arithmetic
par: Henrion, Didier
Publié: (2025)

Two system transformation data-driven algorithms for linear quadratic mean-field games
par: Li, Xun, et autres
Publié: (2024)

Flexibility allocation in random bipartite matching markets: exact matching rates and dominance regimes
par: Ameen, Taha, et autres
Publié: (2026)

Local convergence analysis of stabilized sequential quadratic programming methods for optimization problems in Banach spaces
par: Yamakawa, Yuya
Publié: (2025)

Approximate and exact controllability criteria for linear one-dimensional hyperbolic systems
par: Chitour, Yacine, et autres
Publié: (2023)

Approximation algorithms for integer programming with resource augmentation
par: Brinkop, Hauke, et autres
Publié: (2025)