| Publication | Date of Publication | Type |
|---|
Approximating the chance-constrained capacitated vehicle routing problem with robust optimization
4OR | 2023-10-24 | Paper |
Single machine robust scheduling with budgeted uncertainty
Operations Research Letters | 2023-06-28 | Paper |
| Influence Optimization in Networks: New Formulations and Valid Inequalities | 2022-09-26 | Paper |
Exact approaches for single machine total weighted tardiness batch scheduling
INFORMS Journal on Computing | 2022-07-01 | Paper |
Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
Operations Research | 2021-07-29 | Paper |
Solving bin packing problems using VRPSolver models
SN Operations Research Forum | 2021-06-17 | Paper |
A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints
European Journal of Operational Research | 2021-06-03 | Paper |
An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems
INFORMS Journal on Computing | 2020-12-11 | Paper |
Primal Heuristics for Branch and Price: The Assets of Diving Methods
INFORMS Journal on Computing | 2020-12-03 | Paper |
Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
INFORMS Journal on Computing | 2020-11-09 | Paper |
A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
INFORMS Journal on Computing | 2020-11-09 | Paper |
A generic exact solver for vehicle routing and related problems
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
| A generic exact solver for Vehicle Routing and related problems | 2020-02-06 | Paper |
Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem
Computers & Operations Research | 2020-01-27 | Paper |
An exact approach for the r-interdiction median problem with fortification
RAIRO - Operations Research | 2019-11-06 | Paper |
On the complete set packing and set partitioning polytopes: properties and rank 1 facets
Operations Research Letters | 2019-06-11 | Paper |
Robust scheduling with budgeted uncertainty
Discrete Applied Mathematics | 2019-05-17 | Paper |
Limited memory rank-1 cuts for vehicle routing problems
Operations Research Letters | 2019-02-22 | Paper |
An exact approach for the \(r\)-interdiction covering problem with fortification
CEJOR. Central European Journal of Operations Research | 2019-02-15 | Paper |
Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
European Journal of Operational Research | 2018-07-12 | Paper |
Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
Computers & Operations Research | 2018-07-11 | Paper |
New benchmark instances for the capacitated vehicle routing problem
European Journal of Operational Research | 2018-05-24 | Paper |
A hybrid genetic algorithm with decomposition phases for the unequal area facility layout problem
European Journal of Operational Research | 2018-05-24 | Paper |
Robust constrained shortest path problems under budgeted uncertainty
Networks | 2018-05-23 | Paper |
Integer programming formulations for three sequential discrete competitive location problems with foresight
European Journal of Operational Research | 2017-11-23 | Paper |
Improved branch-cut-and-price for capacitated vehicle routing
Mathematical Programming Computation | 2017-08-15 | Paper |
A branch-and-bound algorithm for the close-enough traveling salesman problem
INFORMS Journal on Computing | 2017-02-08 | Paper |
Robust network design with uncertain outsourcing cost
INFORMS Journal on Computing | 2015-12-21 | Paper |
Exact algorithms for the traveling salesman problem with draft limits
European Journal of Operational Research | 2015-02-19 | Paper |
Formulations for a problem of petroleum transportation
European Journal of Operational Research | 2015-02-04 | Paper |
A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
European Journal of Operational Research | 2014-07-27 | Paper |
Improved branch-cut-and-price for capacitated vehicle routing
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
Optimization Letters | 2013-11-01 | Paper |
The time dependent traveling salesman problem: polyhedra and algorithm
Mathematical Programming Computation | 2013-04-12 | Paper |
Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
Operations Research Letters | 2012-04-05 | Paper |
Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
Mathematical Programming Computation | 2011-01-28 | Paper |
A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
Networks | 2010-11-24 | Paper |
Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
European Journal of Operational Research | 2010-06-11 | Paper |
Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
Operations Research/Computer Science Interfaces | 2010-06-02 | Paper |
A note on the construction of error detecting/correcting prefix codes
Information Processing Letters | 2010-04-19 | Paper |
Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
Mathematical Programming. Series A. Series B | 2008-01-07 | Paper |
A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
Experimental Algorithms | 2008-01-02 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
| scientific article; zbMATH DE number 2086233 (Why is no real title available?) | 2004-08-11 | Paper |
The complexity of makespan minimization for pipeline transportation.
Theoretical Computer Science | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 1947061 (Why is no real title available?) | 2003-07-07 | Paper |
Bounding the Compression Loss of the FGK Algorithm
Journal of Algorithms | 2003-06-09 | Paper |
A strategy for searching with different access costs.
Theoretical Computer Science | 2003-01-21 | Paper |
Three space-economical algorithms for calculating minimum-redundancy prefix codes
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
| On binary searching with non-uniform costs | 2002-06-18 | Paper |
On binary searching with nonuniform costs
SIAM Journal on Computing | 2002-04-23 | Paper |
