:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	van Rossum, Bart, Chen, Rui, Lodi, Andrea
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Optimization and Control
Accesso online:	https://arxiv.org/abs/2311.03885
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Enforcing TSP-Optimality in Fair Vehicle Routing by Cutting Planes
di: van Rossum, Bart, et al.
Pubblicazione: (2026)

Pareto-Optimal Linear Programming
di: van Rossum, Bart, et al.
Pubblicazione: (2025)

Adaptive Partitioning in Column Generation for Nested Paths
di: van Rossum, Bart, et al.
Pubblicazione: (2026)

The Fair Periodic Assignment Problem
di: van Lieshout, Rolf, et al.
Pubblicazione: (2025)

From Sequential Nodes to GPU Batches: Parallel Branch and Bound for Optimal $k$-Sparse GLMs
di: Liu, Jiachang, et al.
Pubblicazione: (2026)

Learning Large Neighborhood Search for Maritime Inventory Routing Optimization
di: Chen, Rui, et al.
Pubblicazione: (2025)

Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming
di: Scavuzzo, Lara, et al.
Pubblicazione: (2024)

Exact Verification of First-Order Methods via Mixed-Integer Linear Programming
di: Ranjan, Vinit, et al.
Pubblicazione: (2024)

Solving 0-1 Integer Programs with Unknown Knapsack Constraints Using Membership Oracles
di: Messana, Rosario, et al.
Pubblicazione: (2024)

Learning to Handle Parameter Perturbations in Combinatorial Optimization: an Application to Facility Location
di: Lodi, Andrea, et al.
Pubblicazione: (2019)

Benders Decomposition for Robust Tactical Railway Crew Scheduling
di: van Rossum, B. T. C., et al.
Pubblicazione: (2024)

Online Decision Making with Fairness over Time
di: Chen, Rui, et al.
Pubblicazione: (2022)

Batched First-Order Methods for Parallel LP Solving in MIP
di: Blin, Nicolas, et al.
Pubblicazione: (2026)

How hard is learning to cut? Trade-offs and sample complexity
di: Khalife, Sammy, et al.
Pubblicazione: (2025)

Electric Vehicle Scheduling and Vehicle-to-Grid Integration in Microgrids
di: Cho, Nathan, et al.
Pubblicazione: (2025)

Assortment Optimization with Visibility Constraints
di: Barre, Theo, et al.
Pubblicazione: (2023)

Efficient First-Order Optimization on the Pareto Set for Multi-Objective Learning under Preference Guidance
di: Chen, Lisha, et al.
Pubblicazione: (2025)

MOSS: Multi-Objective Optimization for Stable Rule Sets
di: Liu, Brian, et al.
Pubblicazione: (2025)

Single Point-Based Distributed Zeroth-Order Optimization with a Non-Convex Stochastic Objective Function
di: Mhanna, Elissa, et al.
Pubblicazione: (2024)

Robust Optimization Under Objective Functional Uncertainty
di: Song, Yue, et al.
Pubblicazione: (2026)

Cutting Planes for Binarized Network Flow Problems
di: Bonami, Pierre, et al.
Pubblicazione: (2025)

Accelerated windowing for the crew rostering problem with machine learning
di: Racette, Philippe, et al.
Pubblicazione: (2025)

A discrete Consensus-Based Global Optimization Method with Noisy Objective Function
di: Bellavia, Stefania, et al.
Pubblicazione: (2024)

Non-Monotonicity of Branching Rules with respect to Linear Relaxations
di: Shah, Prachi, et al.
Pubblicazione: (2024)

Scalable First-order Method for Certifying Optimal k-Sparse GLMs
di: Liu, Jiachang, et al.
Pubblicazione: (2025)

GPU-friendly and Linearly Convergent First-order Methods for Certifying Optimal $k$-sparse GLMs
di: Liu, Jiachang, et al.
Pubblicazione: (2026)

Chance-constrained battery management strategies for the electric bus scheduling problem
di: Ricard, Léa, et al.
Pubblicazione: (2025)

Chvátal-Gomory Rounding of Eigenvector Inequalities for QCQPs
di: Dey, Santanu S., et al.
Pubblicazione: (2026)

Sparse Cuts for the Positive Semidefinite Cone
di: Günlük, Oktay, et al.
Pubblicazione: (2026)

Learning to reoptimize: a GNN-aided fix-and-optimize approach and an application to the Lot Sizing problem
di: Lerouge, Mathieu, et al.
Pubblicazione: (2026)

The Differentiable Feasibility Pump
di: Cacciola, Matteo, et al.
Pubblicazione: (2024)

Solving Max-Cut to Global Optimality via Feasibility-Preserving Graph Neural Networks
di: Chen, Hao, et al.
Pubblicazione: (2026)

SMiLE: Provably Enforcing Global Relational Properties in Neural Networks
di: Francobaldi, Matteo, et al.
Pubblicazione: (2025)

An Efficient Spatial Branch-and-Bound Algorithm for Global Optimization of Gaussian Process Posterior Mean Functions
di: Tang, Wei-Ting, et al.
Pubblicazione: (2026)

Optimization-based Verification of Discrete-time Control Barrier Functions: A Branch-and-Bound Approach
di: Shakhesi, Erfan, et al.
Pubblicazione: (2024)

Uniform Feasibility For Smoothed Backup Control Barrier Functions
di: Alan, Anil, et al.
Pubblicazione: (2025)

$γ$-Competitiveness: An Approach to Multi-Objective Optimization with High Computation Costs in Lipschitz Functions
di: Latypov, Ilgam, et al.
Pubblicazione: (2024)

An improved column-generation-based matheuristic for learning classification trees
di: Patel, Krunal Kishor, et al.
Pubblicazione: (2023)

Designing a Robust and Cost-Efficient Electrified Bus Network with Sparse Energy Consumption Data
di: Momen, Sara, et al.
Pubblicazione: (2025)

Accelerating Single-Point Zeroth-Order Optimization with Regression-Based Gradient Surrogates
di: Chen, Xin, et al.
Pubblicazione: (2025)