José Verschae

From MaRDI portal
Person:490329

Available identifiers

zbMath Open verschae.joseWikidataQ102398787 ScholiaQ102398787MaRDI QIDQ490329

List of research outcomes

PublicationDate of PublicationType
The Impact of Symmetry Handling for the Stable Set Problem via Schreier-Sims Cuts2023-11-10Paper
Optimizing low dimensional functions over the integers2023-11-09Paper
Symmetry Exploitation for Online Machine Covering with Bounded Migration2023-04-26Paper
On the geometry of symmetry breaking inequalities2023-03-14Paper
A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems2022-12-02Paper
https://portal.mardi4nfdi.de/entity/Q50912412022-07-21Paper
On the geometry of symmetry breaking inequalities2021-12-21Paper
Schreier-Sims Cuts meet Stable Set: Preserving Problem Structure when Handling Symmetries2021-11-15Paper
Optimal algorithms for scheduling under time-of-use tariffs2021-11-09Paper
Symmetry exploitation for online machine covering with bounded migration2021-08-04Paper
A Local-Search Algorithm for Steiner Forest2021-06-15Paper
Closing the Gap for Makespan Scheduling via Sparsification Techniques2021-01-08Paper
Breaking symmetries to rescue sum of squares in the case of makespan scheduling2020-08-28Paper
https://portal.mardi4nfdi.de/entity/Q51113612020-05-27Paper
The online set aggregation problem2020-02-12Paper
Breaking symmetries to rescue sum of squares in the case of makespan scheduling2020-02-06Paper
A Water-Filling Primal-Dual Algorithm for Approximating Non-Linear Covering Problems2019-12-27Paper
Dual Techniques for Scheduling on a Machine with Varying Speed2018-07-18Paper
Min-Sum Scheduling Under Precedence Constraints2018-03-02Paper
Splitting versus setup trade-offs for scheduling to minimize weighted completion time2018-02-06Paper
https://portal.mardi4nfdi.de/entity/Q45982122017-12-19Paper
Primal-dual algorithms for precedence constrained covering problems2017-10-09Paper
A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems2017-05-24Paper
Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures2016-08-10Paper
The Power of Recourse for Online MST and TSP2016-07-04Paper
Strong LP formulations for scheduling splittable jobs on unrelated machines2015-12-09Paper
Optimal Algorithms and a PTAS for Cost-Aware Scheduling2015-09-16Paper
On the configuration-LP for scheduling on unrelated machines2015-01-22Paper
Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines2014-06-02Paper
How to Pack Your Items When You Have to Buy Your Knapsack2013-09-20Paper
The Power of Recourse for Online MST and TSP2013-08-12Paper
Dual Techniques for Scheduling on a Machine with Varying Speed2013-08-06Paper
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders2012-05-24Paper
On the Configuration-LP for Scheduling on Unrelated Machines2011-09-16Paper
Scheduling Periodic Tasks in a Hard Real-Time Environment2010-09-07Paper
Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods2010-09-06Paper
A Robust PTAS for Machine Covering and Packing2010-09-06Paper
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders2009-10-28Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: José Verschae