Copertina

On strong valid inequalities for a class of mixed-integer nonlinear sets with box constraints

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Li, Keyan, Wang, Yan-Ru, Chen, Wei-Kun, Dai, Yu-Hong
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Convexification of classes of mixed-integer sets with L$^\natural$-convexity
di: Yu, Qimeng, et al.
Pubblicazione: (2025)

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

Sensitivity analysis for linear changes of the constraint matrix of a (mixed-integer) linear program
di: Derval, Guillaume, et al.
Pubblicazione: (2024)

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

Learning the cost-to-go for mixed-integer nonlinear model predictive control
di: Orrico, Christopher A., et al.
Pubblicazione: (2024)

A graphical framework for global optimization of mixed-integer nonlinear programs
di: Davarnia, Danial, et al.
Pubblicazione: (2024)

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

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)

Column generation for multistage stochastic mixed-integer nonlinear programs with discrete state variables
di: Rathi, Tushar, et al.
Pubblicazione: (2024)

A Quasi-Newton Subspace Trust Region Algorithm for nonmonotone variational inequalities in adversarial learning over box constraints
di: Qiu, Zicheng, et al.
Pubblicazione: (2023)

A fast approximate column-and-constraint generation method for two-stage robust mixed-integer programs
di: Goerigk, Marc, et al.
Pubblicazione: (2025)

Efficient exact sequential lifting algorithm for binary knapsack set
di: Wang, Xintong, et al.
Pubblicazione: (2026)

An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints
di: Hien, Le Thi Khanh, et al.
Pubblicazione: (2022)

An efficient branch-and-cut approach for large-scale competitive facility location problems with limited choice rule
di: Chen, Wei-Kun, et al.
Pubblicazione: (2024)

On the integrality gap of convex mixed-integer programs
di: Kocuk, Burak, et al.
Pubblicazione: (2024)

Piecewise regression via mixed-integer programming for MPC
di: Teichrib, Dieter, et al.
Pubblicazione: (2024)

A geometry in the set of solutions to ill-posed linear problems with box constraints: Applications to probabilities on discrete sets
di: Gzyl, Henryk
Pubblicazione: (2024)

Constructing Magic Squares: an integer constraint satisfaction problem and a fast approach
di: Pamplona, João Vitor, et al.
Pubblicazione: (2025)

Best-response algorithms for a class of monotone Nash equilibrium problems with mixed-integer variables
di: Fabiani, Filippo, et al.
Pubblicazione: (2023)

Feasibility of multiple robust control barrier functions for bounding box constraints
di: Spiller, Mark, et al.
Pubblicazione: (2025)

MPC using mixed-integer programming for aquifer thermal energy storages
di: van Randenborgh, Johannes, et al.
Pubblicazione: (2024)

Efficient modeling of chemotherapy regimens using mixed-integer linear programming
di: Billionnet, Alain
Pubblicazione: (2026)

An efficient mixed-integer linear programming formulation for solving influence diagrams
di: Terho, Topias, et al.
Pubblicazione: (2026)

Analyzing the numerical correctness of branch-and-bound decisions for mixed-integer programming
di: Hoen, Alexander, et al.
Pubblicazione: (2024)

Learning to optimize: A tutorial for continuous and mixed-integer optimization
di: Chen, Xiaohan, et al.
Pubblicazione: (2024)

An efficient branch-and-cut algorithm for the multiple probabilistic covering location problem
di: Wang, Yan-Ru, et al.
Pubblicazione: (2025)

Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems
di: Zeng, Liaoyuan, et al.
Pubblicazione: (2021)

Solving influence diagrams via efficient mixed-integer programming formulations and heuristics
di: Hankimaa, Helmi, et al.
Pubblicazione: (2023)

Distributed Recursion Revisited
di: Zhang, Wei-Yang, et al.
Pubblicazione: (2024)

A feedback control approach to convex optimization with inequality constraints
di: Cerone, V., et al.
Pubblicazione: (2024)

Resource-robust valid inequalities for vehicle routing and related problems
di: Hoogendoorn, Ymro N., et al.
Pubblicazione: (2023)

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

Gap-gradient methods for solving generalized mixed integer inverse optimization: an application to political gerrymandering
di: Smith, Ari J., et al.
Pubblicazione: (2024)

On the tightness of linear relaxations of alternative mixed integer programming formulations for the generator maintenance scheduling problem
di: Andrade, Tiago
Pubblicazione: (2025)

Tilt stability of a class of nonlinear semidefinite programs
di: Liu, Yulan, et al.
Pubblicazione: (2024)

A scalable mixed-integer conic optimization approach to cardinality-constrained Poisson regression with safe screening
di: Kurihara, Kota, et al.
Pubblicazione: (2025)

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

A polynomial-time solvable class of sparse box-constrained polynomial optimization problems
di: Khajavirad, Aida
Pubblicazione: (2026)

Complexity of linearized quadratic penalty for optimization with nonlinear equality constraints
di: Bourkhissi, Lahcen El, et al.
Pubblicazione: (2024)