Saved in:
| Main Authors: | Herrala, Olli, Ekholm, Tommi, Oliveira, Fabricio |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2304.02338 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Risk-averse decision strategies for influence diagrams using rooted junction trees
by: Herrala, Olli, et al.
Published: (2024)
by: Herrala, Olli, et al.
Published: (2024)
A novel strong duality-based reformulation for trilevel infrastructure models in energy systems development
by: Herrala, Olli, et al.
Published: (2023)
by: Herrala, Olli, et al.
Published: (2023)
Solving influence diagrams via efficient mixed-integer programming formulations and heuristics
by: Hankimaa, Helmi, et al.
Published: (2023)
by: Hankimaa, Helmi, et al.
Published: (2023)
Hub location problems with asymmetric allocation
by: Espejo, I., et al.
Published: (2026)
by: Espejo, I., et al.
Published: (2026)
Presolving and cutting planes for the generalized maximal covering location problem
by: Lv, Wei, et al.
Published: (2024)
by: Lv, Wei, et al.
Published: (2024)
An efficient branch-and-cut algorithm for the multiple probabilistic covering location problem
by: Wang, Yan-Ru, et al.
Published: (2025)
by: Wang, Yan-Ru, et al.
Published: (2025)
An extension of an RLT-based solver to MINLP polynomial problems
by: González-Díaz, Julio, et al.
Published: (2024)
by: González-Díaz, Julio, et al.
Published: (2024)
An efficient branch-and-cut approach for large-scale competitive facility location problems with limited choice rule
by: Chen, Wei-Kun, et al.
Published: (2024)
by: Chen, Wei-Kun, et al.
Published: (2024)
An efficient branch-and-cut approach for the sequential competitive facility location problem under partially binary rule
by: Guo, Yu-Qi, et al.
Published: (2025)
by: Guo, Yu-Qi, et al.
Published: (2025)
A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
by: Borges, Jennifer C., et al.
Published: (2026)
by: Borges, Jennifer C., et al.
Published: (2026)
Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
by: Gómez-Casares, Ignacio, et al.
Published: (2025)
by: Gómez-Casares, Ignacio, et al.
Published: (2025)
Adaptive Partitioning for Chance-Constrained Problems with Finite Support
by: Roland, Marius, et al.
Published: (2023)
by: Roland, Marius, et al.
Published: (2023)
GFORS: GPU-Accelerated First-Order Method with Randomized Sampling for Binary Integer Programs
by: Wei, Ningji, et al.
Published: (2025)
by: Wei, Ningji, et al.
Published: (2025)
Exploiting Overlap Information in Chance-constrained Program with Random Right-hand Side
by: Lv, Wei, et al.
Published: (2024)
by: Lv, Wei, et al.
Published: (2024)
Exact augmented Lagrangian duality for mixed integer convex optimization
by: Bhardwaj, Avinash, et al.
Published: (2022)
by: Bhardwaj, Avinash, et al.
Published: (2022)
Exact Decomposition Branching exploiting Lattice Structures
by: Halbig, Katrin, et al.
Published: (2024)
by: Halbig, Katrin, et al.
Published: (2024)
Bi-Parameterized Two-Stage Stochastic Min-Max and Min-Min Mixed Integer Programs
by: Kang, Sumin, et al.
Published: (2025)
by: Kang, Sumin, et al.
Published: (2025)
The Quadratic Bin Packing Problem: Exact Formulations and Algorithm
by: Chagas, Vítor Gomes, et al.
Published: (2026)
by: Chagas, Vítor Gomes, et al.
Published: (2026)
Distributionally Risk-Receptive and Robust Multistage Stochastic Integer Programs and Interdiction Models
by: Kang, Sumin, et al.
Published: (2024)
by: Kang, Sumin, et al.
Published: (2024)
Affordable mixed-integer Lagrangian methods: optimality conditions and convergence analysis
by: De Marchi, Alberto
Published: (2024)
by: De Marchi, Alberto
Published: (2024)
Augmentation approaches for Mixed Integer Programming
by: Puerto, Justo, et al.
Published: (2025)
by: Puerto, Justo, et al.
Published: (2025)
$\mathcal{V}$-Polyhedral Disjunctive Cuts
by: Balas, Egon, et al.
Published: (2022)
by: Balas, Egon, et al.
Published: (2022)
Neural Embedded Mixed-Integer Optimization for Location-Routing Problems
by: Kaleem, Waquar, et al.
Published: (2024)
by: Kaleem, Waquar, et al.
Published: (2024)
Superadditivity-based valid inequalities and asymptotic bounds for the vehicle routing problem with stochastic demands
by: Legault, Robin, et al.
Published: (2025)
by: Legault, Robin, et al.
Published: (2025)
Exact solution approaches for the discrete $α$-neighbor $p$-center problem
by: Gaar, Elisabeth, et al.
Published: (2022)
by: Gaar, Elisabeth, et al.
Published: (2022)
Spectral Outer-Approximation Algorithms for Binary Semidefinite Problems
by: de Roux, Daniel, et al.
Published: (2025)
by: de Roux, Daniel, et al.
Published: (2025)
Investigating mixed-integer programming approaches for the $p$-$α$-closest-center problem
by: Gaar, Elisabeth, et al.
Published: (2026)
by: Gaar, Elisabeth, et al.
Published: (2026)
An Exact Algorithm for Public Transport Line Planning Considering Passenger and Operational Costs and Lost Demand
by: Hansen, Siv Marie Cartland, et al.
Published: (2026)
by: Hansen, Siv Marie Cartland, et al.
Published: (2026)
A Safe Approximation Based on Mixed-Integer Optimization for Non-Convex Distributional Robustness Governed by Univariate Indicator Functions
by: Dienstbier, Jana, et al.
Published: (2023)
by: Dienstbier, Jana, et al.
Published: (2023)
Surrogate-based categorical neighborhoods for mixed-variable blackbox optimization
by: Audet, Charles, et al.
Published: (2026)
by: Audet, Charles, et al.
Published: (2026)
CatMADS: Mesh Adaptive Direct Search for constrained blackbox optimization with categorical variables
by: Audet, Charles, et al.
Published: (2025)
by: Audet, Charles, et al.
Published: (2025)
A Frank-Wolfe-based primal heuristic for quadratic mixed-integer optimization
by: Mexi, Gioni, et al.
Published: (2025)
by: Mexi, Gioni, et al.
Published: (2025)
A Unifying Convexification Framework for Chance-Constrained Programs via Bilinear Extended Formulations over a Simplex
by: Davarnia, Danial, et al.
Published: (2025)
by: Davarnia, Danial, et al.
Published: (2025)
Lagrangian cuts generated by batch to efficiently solve two-stage stochastic mixed-integer program
by: Xiaoyu, Luo, et al.
Published: (2024)
by: Xiaoyu, Luo, et al.
Published: (2024)
Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization
by: Bomze, Immanuel, et al.
Published: (2024)
by: Bomze, Immanuel, et al.
Published: (2024)
Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
by: Lapucci, Matteo, et al.
Published: (2024)
by: Lapucci, Matteo, et al.
Published: (2024)
Multi-timescale Stochastic Programming with Applications in Power Systems
by: Zhang, Yihang, et al.
Published: (2025)
by: Zhang, Yihang, et al.
Published: (2025)
Solving Constrained Affine Heaviside Composite Optimization Problems by a Progressive IP Approach
by: Zheng, Ke, et al.
Published: (2026)
by: Zheng, Ke, et al.
Published: (2026)
Adjustable Robust Nonlinear Network Design Without Controllable Elements under Load Scenario Uncertainties
by: Thürauf, Johannes, et al.
Published: (2024)
by: Thürauf, Johannes, et al.
Published: (2024)
The Cooperative Maximal Covering Location Problem with ordered partial attractions
by: Domínguez, Concepción, et al.
Published: (2023)
by: Domínguez, Concepción, et al.
Published: (2023)
Similar Items
-
Risk-averse decision strategies for influence diagrams using rooted junction trees
by: Herrala, Olli, et al.
Published: (2024) -
A novel strong duality-based reformulation for trilevel infrastructure models in energy systems development
by: Herrala, Olli, et al.
Published: (2023) -
Solving influence diagrams via efficient mixed-integer programming formulations and heuristics
by: Hankimaa, Helmi, et al.
Published: (2023) -
Hub location problems with asymmetric allocation
by: Espejo, I., et al.
Published: (2026) -
Presolving and cutting planes for the generalized maximal covering location problem
by: Lv, Wei, et al.
Published: (2024)