| Publication | Date of Publication | Type |
|---|
Adjustable robust positive influence dominating set with partial payment
Computers & Operations Research | 2026-05-04 | Paper |
An exact approach for the Stackelberg knapsack problem with weight selection
Journal of Global Optimization | 2025-08-20 | Paper |
Deep learning based high accuracy heuristic approach for knapsack interdiction problem
Computers & Operations Research | 2025-06-05 | Paper |
A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm
INFORMS Journal on Computing | 2022-12-01 | Paper |
| Robust solutions for stochastic and distributionally robust chance-constrained binary knapsack problems | 2021-05-25 | Paper |
| Using the WOWA criterion for two-stage decision making problems | 2021-04-15 | Paper |
| A branch-and-price algorithm for the robust single-source capacitated facility location problem under demand uncertainty | 2021-03-24 | Paper |
Lifting of probabilistic cover inequalities
Operations Research Letters | 2019-02-22 | Paper |
Lifting and separation of robust cover inequalities
Networks | 2018-10-04 | Paper |
Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network
Annals of Operations Research | 2018-06-12 | Paper |
Embedded variable selection method using signomial classification
Annals of Operations Research | 2017-08-25 | Paper |
Robust optimization approach for a chance-constrained binary knapsack problem
Mathematical Programming. Series A. Series B | 2016-06-06 | 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 |
Chebyshev center based column generation
Discrete Applied Mathematics | 2012-03-19 | Paper |
Telecommunication node clustering with node compatibility and network survivability requirements
Management Science | 2012-02-12 | Paper |
Optimality of the symmetric workload allocation in a single-server flow line system
Management Science | 2012-02-12 | 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 |
Optimal multicast route packing
European Journal of Operational Research | 2009-01-08 | Paper |
A branch-and-price algorithm for a targeting problem
Naval Research Logistics | 2008-05-14 | Paper |
Comparison of wavelength requirements between two wavelength assignment methods in survivable WDM networks
Annals of Operations Research | 2007-02-05 | Paper |
ATM VP-based network design
European Journal of Operational Research | 2004-08-10 | Paper |
Algorithms for the variable sized bin packing problem
European Journal of Operational Research | 2003-04-28 | Paper |
A branch-and-price algorithm for the Steiner tree packing problem.
Computers & Operations Research | 2002-01-01 | Paper |
An integer programming approach to the time slot assignment problem in SS/TDMA systems with intersatellite links
European Journal of Operational Research | 2001-01-01 | Paper |
Efficient operation of a surface mounting machine with a multihead turret
International Journal of Production Research | 2000-11-08 | Paper |
Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
European Journal of Operational Research | 2000-09-13 | Paper |
| The single allocation problem in the interacting three-hub network | 2000-06-27 | 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 |
A linear program for the two-hub location problem
European Journal of Operational Research | 1999-05-18 | Paper |
An extended formulation approach to the edge-weighted maximal clique problem
European Journal of Operational Research | 1999-02-22 | Paper |
Joint price and lot size determination under conditions of permissible delay in payments and quantity discounts for freight cost
European Journal of Operational Research | 1999-02-22 | Paper |
An Integer Programming Approach to the Bandwidth Packing Problem
Management Science | 1997-11-12 | Paper |
Lifting cover inequalities for the precedence-constrained knapsack problem
Discrete Applied Mathematics | 1997-03-05 | Paper |
A polyhedral approach to edge coloring
Operations Research Letters | 1992-06-27 | Paper |
