:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ahmed, Abdulaziz, Jebali, Aida
Format:	Preprint
Publié:	2025
Sujets:	Discrete Mathematics
Accès en ligne:	https://arxiv.org/abs/2501.08929
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

An exact approach for the multi-depot electric vehicle scheduling problem
par: Haslinger, Xenia, et autres
Publié: (2025)

Task scheduling for autonomous vehicles in the Martian environment
par: Burzyński, Wojciech, et autres
Publié: (2024)

A column-generation approach for an electricity technician routing and scheduling problem with a lexicographic objective
par: Bangerter, Elise, et autres
Publié: (2026)

Approximation algorithms for job scheduling with block-type conflict graphs
par: Furmańczyk, Hanna, et autres
Publié: (2022)

On scheduling coupled tasks with exact delays to minimize maximum lateness
par: Kubiak, Wiesław
Publié: (2026)

Multi-machine preventative maintenance scheduling with imperfect interventions: a restless bandit approach
par: Ruiz-Hernandez, Diego, et autres
Publié: (2024)

Order acceptance and scheduling in capacitated job shops
par: Linß, Florian, et autres
Publié: (2024)

A metaheuristic for crew scheduling in a pickup-and-delivery problem with time windows
par: Lucci, Mauro, et autres
Publié: (2021)

Compact formulations and valid inequalities for parallel machine scheduling with conflicts
par: Moura, Phablo F. S., et autres
Publié: (2023)

A mathematical model for simultaneous personnel shift planning and unrelated parallel machine scheduling
par: Khadivi, Maziyar, et autres
Publié: (2024)

Efficient approximation schemes for scheduling on a stochastic number of machines
par: Epstein, Leah, et autres
Publié: (2024)

Mixed-integer linear programming approaches for nested $p$-center problems with absolute and relative regret objectives
par: Brandstetter, Christof, et autres
Publié: (2024)

Extended formulations for the multilinear polytope of acyclic hypergraphs
par: Del Pia, Alberto, et autres
Publié: (2025)

The complete edge relaxation for binary polynomial optimization
par: Del Pia, Alberto, et autres
Publié: (2025)

Rank-one Boolean tensor factorization and the multilinear polytope
par: Del Pia, Alberto, et autres
Publié: (2022)

Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization
par: Del Pia, Alberto, et autres
Publié: (2024)

The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
par: Del Pia, Alberto, et autres
Publié: (2023)

A Method to Generate Multi-interval Pairwise Compatibility Graphs
par: Hayat, Seemab, et autres
Publié: (2024)

On some 2-binomial coefficients of binary words: geometrical interpretation, partitions of integers, and fair words
par: Richomme, Gwenaël
Publié: (2025)

Effective approach of the tridendriform Schroeder tree algebra
par: Catoire, Pierre, et autres
Publié: (2026)

Computing fixed point free automorphisms of graphs
par: Abiad, Aida, et autres
Publié: (2026)

Counting Tree-Like Multigraphs with a Given Number of Vertices and Multiple Edges
par: Ilyas, Muhammad, et autres
Publié: (2025)

A generic Branch-and-Cut algorithm for bi-objective binary linear programs
par: Fouilhoux, Pierre, et autres
Publié: (2024)

On the Convergence of Elementary Cellular Automata under Sequential Update Modes
par: Donoso-Leiva, Isabel, et autres
Publié: (2025)

A study of distributionally robust mixed-integer programming with Wasserstein metric: on the value of incomplete data
par: Ketkov, Sergey S.
Publié: (2023)

Enumeration of Tree-like Multigraphs with a Given Number of Vertices, Self-loops and Multiple Edges
par: Azam, Naveed Ahmed, et autres
Publié: (2025)

Formal Primal-Dual Algorithm Analysis
par: Abdulaziz, Mohammad, et autres
Publié: (2026)

The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes
par: Tiskin, Alexander
Publié: (2022)

Reachability in temporal graphs under perturbation
par: Enright, Jessica, et autres
Publié: (2024)

Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
par: Foucaud, Florent, et autres
Publié: (2025)

A distance-free approach to generalized weights
par: Di Giusto, Andrea, et autres
Publié: (2025)

Directed treewidth is closed under taking butterfly minors
par: Kim, Gunwoo, et autres
Publié: (2025)

Approximating temporal modularity on graphs of small underlying treewidth
par: Agdur, Vilhelm, et autres
Publié: (2025)

Type-B analogue of Bell numbers using Rota's Umbral calculus approach
par: Bagno, Eli, et autres
Publié: (2024)

Characterizing traces of processes defined by precedence and response constraints: an order theory approach
par: Dukes, Mark, et autres
Publié: (2023)

Morse Sequences: A simple approach to discrete Morse theory
par: Bertrand, Gilles
Publié: (2024)

Approximating Maximum Edge 2-Coloring by Normalizing Graphs
par: Mömke, Tobias, et autres
Publié: (2024)

The $g$-good-neighbor diagnosability of product networks under the PMC model
par: Wang, Zhao, et autres
Publié: (2025)

Trees with maximum $σ$-irregularity under a prescribed maximum degree 6
par: Bašić, Milan
Publié: (2026)

Applying constraint programming to minimal lottery designs
par: Cushing, David, et autres
Publié: (2023)