Cover Image

Developing an Algorithm Selector for Green Configuration in Scheduling Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	March, Carlos, Perez, Christian, Salido, Miguel A.
Format:	Preprint
Published:	2024
Subjects:	Artificial Intelligence 90C27
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Assignment-Routing Optimization: Solvers for Problems Under Constraints
by: Qilong, Yuan, et al.
Published: (2025)

Efficient Policy Learning with Hybrid Evaluation-Based Genetic Programming for Uncertain Agile Earth Observation Satellite Scheduling
by: Xue, Junhua, et al.
Published: (2026)

An Efficient and Almost Optimal Solver for the Joint Routing-Assignment Problem via Partial JRA and Large-α Optimization
by: Yuan, Qilong
Published: (2025)

Solving Parallel Machine Scheduling With Precedences and Cumulative Resource Constraints With Calendars
by: Einspieler, Christoph, et al.
Published: (2025)

Text2Model: Modeling Copilots for Text-to-Model Translation
by: Kadioglu, Serdar, et al.
Published: (2026)

An Efficient Continuous-Time MILP for Integrated Aircraft Hangar Scheduling and Layout
by: Pazhooh, Shayan Farhang, et al.
Published: (2025)

A Learning Method with Gap-Aware Generation for Heterogeneous DAG Scheduling
by: Zhou, Ruisong, et al.
Published: (2026)

Instance Configuration for Sustainable Job Shop Scheduling
by: Perez, Christian, et al.
Published: (2024)

LMask: Learn to Solve Constrained Routing Problems with Lazy Masking
by: Li, Tianyou, et al.
Published: (2025)

Learning to Solve the Quadratic Assignment Problem with Warm-Started MCMC Finetuning
by: Pan, Yicheng, et al.
Published: (2026)

Large Language Model for Discrete Optimization Problems: Evaluation and Step-by-step Reasoning
by: Qian, Tianhao, et al.
Published: (2026)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
by: Quintero, Rodolfo A., et al.
Published: (2024)

SDP Approach to Quadratic Vertex-Disjoint Paths Problem
by: Xu, Mingming, et al.
Published: (2026)

A Canceling Heuristic for the Directed Traveling Salesman Problem
by: Borgwardt, Steffen, et al.
Published: (2026)

Graph-Coarsening Approach for the Capacitated Vehicle Routing Problem with Time Windows
by: Özyılmaz, Mustafa Mert
Published: (2025)

Equitable Routing--Rethinking the Multiple Traveling Salesman Problem
by: Bhadoriya, Abhay Singh, et al.
Published: (2024)

Pairwise independent correlation gap
by: Ramachandra, Arjun, et al.
Published: (2022)

Data-Driven Hull-Fouling Cleaning Schedule Optimization to Reduce Carbon Footprint of Vessels
by: Ward, Samuel, et al.
Published: (2026)

Solving Cutting Stock Problems via an Extended Ryan-Foster Branching Scheme and Fast Column Generation
by: da Silva, Renan F. F., et al.
Published: (2023)

Polynomial and Pseudopolynomial Algorithms for Two Classes of Bin Packing Instances
by: da Silva, Renan Fernando Franco, et al.
Published: (2026)

Solving the Market Split Problem with Lattice Enumeration
by: Wassermann, Alfred
Published: (2025)

Solving Hard Instances from Knapsack and Bounded Knapsack Problems: A new state-of-the-art solver
by: da Silva, Renan F. F., et al.
Published: (2026)

Reinforcement Learning for Search Tree Size Minimization in Constraint Programming: New Results on Scheduling Benchmarks
by: Heinz, Vilém, et al.
Published: (2025)

Augmentation Algorithms for Integer Programs with Total Variation-like Regularization
by: Yang, Dominic, et al.
Published: (2025)

Solving Combinatorial Pricing Problems using Embedded Dynamic Programming Models
by: Bui, Quang Minh, et al.
Published: (2024)

Assignment-Routing Optimization : Efficient Heuristic Solver with Shaking Algorithm
by: Qilong, Yuan, et al.
Published: (2025)

Block Stacking, Airplane Refueling, and Robust Appointment Scheduling
by: Gmeiner, Simon, et al.
Published: (2026)

On different Versions of the Exact Subgraph Hierarchy for the Stable Set Problem
by: Gaar, Elisabeth
Published: (2020)

Evacuation Planning on Time-Expanded Networks with Integrated Wildfire Information
by: Borgwardt, Steffen, et al.
Published: (2024)

Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method
by: Jung, Woosuk L., et al.
Published: (2023)

Branch-Price-and-Cut Accelerated with a Pricing for Integrality Heuristic for the Electrical Vehicle Routing Problem with Time Windows and Charging Time Slots
by: Eveborn, Lukas, et al.
Published: (2026)

The Generalized Double Pouring Problem: Analysis, Bounds and Algorithms
by: Jäger, Gerold, et al.
Published: (2025)

Computing All Shortest Passenger Routes with a Tropical Dijkstra Algorithm
by: Masing, Berenike, et al.
Published: (2024)

Edge expansion of a graph: SDP-based computational strategies
by: Gupte, Akshay, et al.
Published: (2024)

Relaxations for binary polynomial optimization via signed certificates
by: Xu, Liding, et al.
Published: (2024)

On exactness of SDP relaxation for the maximum cut problem
by: Bhardwaj, Avinash, et al.
Published: (2025)

Structural Insights and an IP-based Solution Method for Patient-to-room Assignment under Consideration of Single Room Entitlements
by: Brandt, Tabea, et al.
Published: (2023)

Decision Diagram-Based Branch-and-Bound with Caching for Dominance and Suboptimality Detection
by: Coppé, Vianney, et al.
Published: (2022)

Accuracy and Performance Evaluation of Quantum, Classical and Hybrid Solvers for the Max-Cut Problem
by: Vodeb, Jaka, et al.
Published: (2024)

Real-time solution of quadratic optimization problems with banded matrices and indicator variables
by: Gomez, Andres, et al.
Published: (2024)