Imagen de Portada

Efficient Branching Rules for Optimizing Range and Order-Based Objective Functions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	van Rossum, Bart, Chen, Rui, Lodi, Andrea
Formato:	Preprint
Publicado:	2023
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Assortment Optimization with Visibility Constraints
por: Barre, Theo, et al.
Publicado: (2023)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Acceleration Exists! Optimization Problems When Oracle Can Only Compare Objective Function Values
por: Lobanov, Aleksandr, et al.
Publicado: (2024)

Scalable Second-Order Optimization Algorithms for Minimizing Low-rank Functions
por: Tansley, Edward, et al.
Publicado: (2025)

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

Branching Adaptive Surrogate Search Optimization (BASSO)
por: Maneekul, Pariyakorn, et al.
Publicado: (2025)

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

The Differentiable Feasibility Pump
por: Cacciola, Matteo, et al.
Publicado: (2024)