Imagen de Portada

Solving a large oral examination timetabling problem using a multidimensional knapsack MILP formulation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Briand, Cyrille, Belaud, Jean-Pierre
Formato:	Preprint
Publicado:	2026
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

An iterative Constraint Programming approach to integrate maximum workload constraints in preemptive jobshop scheduling
por: Terrien, Tanguy, et al.
Publicado: (2026)

The colored knapsack problem: structural properties and exact algorithms
por: Ciccarelli, Fabio, et al.
Publicado: (2026)

Optimizing rake-links independently of timetables in railway operations
por: Dey, Sourav
Publicado: (2025)

Parallel Newton methods for the continuous quadratic knapsack problem: A Jacobi and Gauss-Seidel tale
por: Secchin, Leonardo D., et al.
Publicado: (2026)

Integrated timetabling and scheduling of modular autonomous vehicles under uncertainty
por: Xia, Dongyang, et al.
Publicado: (2024)

CORL: Reinforcement Learning of MILP Policies Solved via Branch and Bound
por: Anand, Akhil S, et al.
Publicado: (2025)

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

On contention resolution for the hypergraph matching, knapsack, and $k$-column sparse packing problems
por: Sergeev, Ivan
Publicado: (2024)

Train timetabling with rolling stock assignment, short-turning and skip-stop strategy for a bidirectional metro line
por: Salode, Chanchal Kumar, et al.
Publicado: (2024)

CLCR: Contrastive Learning-based Constraint Reordering for Efficient MILP Solving
por: Zeng, Shuli, et al.
Publicado: (2025)

A disruption-restoration-based MILP model for elective surgical scheduling in a children's hospital using scenarios
por: Doneda, Martina, et al.
Publicado: (2024)

Event-based MILP models for ride pooling applications
por: Gaul, Daniela, et al.
Publicado: (2021)

Integrated demand-side management and timetabling for an urban rail transit line: A Benders decomposition approach
por: Yang, Lixing, et al.
Publicado: (2025)

Code Retrieval for MILP Instance Generation
por: Yang, Tianxing, et al.
Publicado: (2025)

An MILP-Based Solution Scheme for Factored and Robust Factored Markov Decision Processes
por: Liu, Huikang, et al.
Publicado: (2024)

An LLM-powered MILP modelling engine for workforce scheduling guided by expert knowledge
por: Li, Qingyang, et al.
Publicado: (2025)

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

Adaptive Efficiency Optimization in SDLC: An MILP Approach for Balanced and Cost-Effective Resource Allocation
por: Kumar, Lokendra, et al.
Publicado: (2025)

Inverse problems for linear parabolic equations using mixed formulations - Part 1 : Theoretical analysis
por: Munch, Arnaud, et al.
Publicado: (2015)

Second order optimality conditions in a new Lagrangian formulation for optimal control problems
por: Konopik, Michael, et al.
Publicado: (2025)

Contributions on complexity bounds for Deterministic Partially Observed Markov Decision Process
por: Vessaire, Cyrille, et al.
Publicado: (2023)

A new formulation for the collection and delivery problem of biomedical specimen
por: Rocha, Luis Aurelio, et al.
Publicado: (2024)

Distributional MIPLIB: a Multi-Domain Library for Advancing ML-Guided MILP Methods
por: Huang, Weimin, et al.
Publicado: (2024)

Stabilization of Integral Difference Equations by Solving a Corona Problem
por: Braun, Adam, et al.
Publicado: (2026)

The quadratic minimum spanning tree problem: lower bounds via extended formulations
por: Sotirov, Renata, et al.
Publicado: (2021)

A hybrid large neighborhood search algorithm for the integrated dial-a-ride problem using electric vehicles
por: Fang, Yumeng, et al.
Publicado: (2025)

Solving moment and polynomial optimization problems on Sobolev spaces
por: Henrion, Didier, et al.
Publicado: (2024)

Solving the train-platforming problem via a two-level Lagrangian Relaxation approach
por: Zhang, Qin, et al.
Publicado: (2024)

Learn to formulate: A surrogate model framework for generalized assignment problem with routing constraints
por: Xue, Sen, et al.
Publicado: (2024)

On vehicle routing problems with stochastic demands -- Generic disaggregated integer L-shaped formulations
por: Ota, Matheus J., et al.
Publicado: (2025)

Optimization by Directional Attacks: Solving Problems with Neural Network Surrogates
por: Bouchet, Pierre-Yves, et al.
Publicado: (2025)

Globally Solving a Class of Bilevel Programs with Spatial Price Equilibrium Constraints
por: Goyal, Akshit, et al.
Publicado: (2023)

Solving unbounded optimal control problems with the moment-SOS hierarchy *
por: Sehnalová, Karolına, et al.
Publicado: (2025)

Solving Schrödinger bridge problem via continuous normalizing flow
por: Jing, Yang, et al.
Publicado: (2025)

Solving bilevel problems with products of upper- and lower-level variables
por: Hajikazemi, Sina, et al.
Publicado: (2024)

A Benamou-Brenier formulation for the multi-marginal optimal transport problem with infimal convolution cost
por: Krannich, Friedemann
Publicado: (2025)

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

Principal-agent problems with adverse selection: A stochastic target problem formulation
por: Alvarez, Guillermo Alonso, et al.
Publicado: (2026)

Tree-based formulation for the multi-commodity flow problem
por: Spoorendonk, Simon, et al.
Publicado: (2025)

Learning optimal objective values for MILP
por: Scavuzzo, Lara, et al.
Publicado: (2024)