| Publication | Date of Publication | Type |
|---|
New integer optimization models and decomposition-based algorithms for the multi-agent pathfinding problem with time-spacing constraints
European Journal of Operational Research | 2026-02-24 | Paper |
Theoretical analysis of integer programming models for the two-dimensional two-staged knapsack problem
Optimization Letters | 2025-11-26 | Paper |
Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem
European Journal of Operational Research | 2024-07-16 | Paper |
Comparative analysis of linear programming relaxations for the robust knapsack problem
Annals of Operations Research | 2023-07-13 | Paper |
Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups
European Journal of Operational Research | 2023-07-11 | Paper |
New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups
European Journal of Operational Research | 2022-05-20 | Paper |
A fully polynomial time approximation scheme for the probability maximizing shortest path problem
European Journal of Operational Research | 2022-03-11 | Paper |
Norm ball classifier for one-class classification
Annals of Operations Research | 2021-11-08 | Paper |
Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops
Applied Mathematical Modelling | 2020-03-27 | Paper |
Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity
Optimization Letters | 2020-02-27 | Paper |
Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem
Computers & Operations Research | 2019-07-09 | Paper |
Embedded variable selection method using signomial classification
Annals of Operations Research | 2017-08-25 | Paper |
Distribution-robust loss-averse optimization
Optimization Letters | 2017-06-29 | Paper |
Computing lower bounds on basket option prices by discretizing semi-infinite linear programming
Optimization Letters | 2017-03-28 | Paper |
Distribution-robust single-period inventory control problem with multiple unreliable suppliers
OR Spectrum | 2016-10-27 | Paper |
Robust optimization approach for a chance-constrained binary knapsack problem
Mathematical Programming. Series A. Series B | 2016-06-06 | Paper |
The sparse signomial classification and regression model
Annals of Operations Research | 2014-09-26 | Paper |
Benders decomposition approach for the robust network design problem with flow bifurcations
Networks | 2013-08-06 | Paper |
Technical note: Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations
Operations Research | 2012-11-08 | Paper |
Telecommunication node clustering with node compatibility and network survivability requirements
Management Science | 2012-02-12 | Paper |
Integral polyhedra related to integer multicommodity flows on a cycle
Discrete Applied Mathematics | 2010-05-05 | Paper |
AN LP-BASED APPROACH TO THE RING LOADING PROBLEM WITH INTEGER DEMAND SPLITTING
Journal of the Operations Research Society of Japan | 2009-07-06 | Paper |
A compact formulation of the ring loading problem with integer demand splitting
Operations Research Letters | 2009-05-07 | Paper |
Optimization Problems in the Simulation of Multifactor Portfolio Credit Risk
Computational Science and Its Applications - ICCSA 2006 | 2009-02-10 | Paper |
A branch-and-price algorithm for a targeting problem
Naval Research Logistics | 2008-05-14 | Paper |
A branch-and-price algorithm for the Steiner tree packing problem.
Computers & Operations Research | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 1357793 (Why is no real title available?) | 2000-06-14 | Paper |
Economic spare capacity planning for DCS mesh-restorable networks
European Journal of Operational Research | 2000-05-25 | Paper |
Design of local networks using USHRs
Telecommunication Systems | 2000-01-01 | Paper |
An extended formulation approach to the edge-weighted maximal clique problem
European Journal of Operational Research | 1999-02-22 | Paper |
