| Publication | Date of Publication | Type |
|---|
Stabilizing grand cooperation via cost adjustment: an inverse optimization approach
INFORMS Journal on Computing | 2024-07-29 | Paper |
New exact and heuristic algorithms for general production and delivery integration
European Journal of Operational Research | 2024-07-02 | Paper |
An Approximation Algorithm for k-Depot Split Delivery Vehicle Routing Problem
INFORMS Journal on Computing | 2024-03-22 | Paper |
A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries
INFORMS Journal on Computing | 2024-02-27 | Paper |
MIMO Radar Waveform Design for Multipath Exploitation
IEEE Transactions on Signal Processing | 2022-09-23 | Paper |
Noisy-as-Clean: Learning Self-Supervised Denoising From Corrupted Image
IEEE Transactions on Image Processing | 2022-09-16 | Paper |
Fixed-time bipartite consensus of nonlinear multi-agent systems under directed signed graphs with disturbances
Journal of the Franklin Institute | 2022-04-14 | Paper |
A new dynamic shape adjustment and placement algorithm for 3D yard allocation problem with time dimension
Computers & Operations Research | 2022-03-09 | Paper |
New lower bound and exact method for the continuous berth allocation problem
Operations Research | 2020-10-12 | Paper |
Simultaneous penalization and subsidization for stabilizing grand cooperation
Operations Research | 2020-10-12 | Paper |
A new convergent hybrid learning algorithm for two-stage stochastic programs
European Journal of Operational Research | 2020-01-23 | Paper |
The knapsack problem with a minimum filling constraint
Naval Research Logistics | 2019-03-05 | Paper |
An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem
European Journal of Operational Research | 2018-05-24 | Paper |
An improved approximation algorithm for the capacitated TSP with pickup and delivery on a tree
Networks | 2018-05-11 | Paper |
| Periodic traveling wave solution in a diffusive predator-prey system | 2018-01-29 | Paper |
Computing near-optimal stable cost allocations for cooperative games by Lagrangian relaxation
INFORMS Journal on Computing | 2017-02-08 | Paper |
Improved algorithms for joint optimization of facility locations and network connections
European Journal of Operational Research | 2016-10-07 | Paper |
A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
INFORMS Journal on Computing | 2016-04-25 | Paper |
Bifurcation analysis of a diffusive predator-prey system with a herd behavior and quadratic mortality
Mathematical Methods in the Applied Sciences | 2016-01-15 | Paper |
Exact and approximation algorithms for the min-max \(k\)-traveling salesmen problem on a tree
European Journal of Operational Research | 2014-07-28 | Paper |
Corrigendum to: ``Approximation hardness of min-max tree covers
Operations Research Letters | 2014-05-15 | Paper |
| Comparing present values of life annuity of multi-life status under different dependence structures | 2013-01-24 | Paper |
A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
European Journal of Operational Research | 2012-08-16 | Paper |
The freight allocation problem with lane cost balancing constraint
European Journal of Operational Research | 2012-08-16 | Paper |
Approximation results for a min-max location-routing problem
Discrete Applied Mathematics | 2012-03-19 | Paper |
An analysis of the extended Christofides heuristic for the \(k\)-depot TSP
Operations Research Letters | 2011-08-19 | Paper |
A fully polynomial approximation scheme for a knapsack problem with a minimum filling constraint (extended abstract)
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Approximation results for min-max path cover problems in vehicle routing
Naval Research Logistics | 2011-01-06 | Paper |
A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Approximation hardness of min-max tree covers
Operations Research Letters | 2010-06-08 | Paper |
Erratum
Operations Research | 2010-03-06 | Paper |
Approximation algorithms for min-max path cover problems with service handling time
Algorithms and Computation | 2009-12-17 | Paper |
Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees
Operations Research | 2009-08-13 | Paper |
Principles and Practice of Constraint Programming – CP 2004
Lecture Notes in Computer Science | 2008-09-09 | Paper |
A m‐parallel crane scheduling problem with a non‐crossing constraint
Naval Research Logistics | 2008-01-16 | Paper |
Transshipment through crossdocks with inventory and time windows
Naval Research Logistics | 2007-05-24 | Paper |
The bottleneck problem with minimum quantity commitments
Naval Research Logistics | 2007-02-20 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
A critical-shaking neighborhood search for the yard allocation problem
European Journal of Operational Research | 2006-09-13 | Paper |
The one‐commodity pickup and delivery travelling salesman problem on a path or a tree
Networks | 2006-09-12 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
\(k\)-center problems with minimum coverage
Theoretical Computer Science | 2005-04-06 | Paper |
| scientific article; zbMATH DE number 2040689 (Why is no real title available?) | 2004-02-11 | Paper |
