| Publication | Date of Publication | Type |
|---|
Hysteresis behavior and pyroelectric properties of multi-surface ferroelectric thin films
Chinese Journal of Physics (Taipei) | 2024-05-08 | Paper |
scientific article; zbMATH DE number 6863577 (Why is no real title available?)
| 2018-04-23 | Paper |
Minimum cost flow problem
| 2018-04-23 | Paper |
Multicommodity flows
| 2018-04-23 | Paper |
A very large-scale neighborhood search algorithm for the combined through-fleet-assignment model
INFORMS Journal on Computing | 2012-06-18 | Paper |
A heuristic approach to the multi-period single-sourcing problem with production and inventory capacities and perishability constraints
INFORMS Journal on Computing | 2012-06-18 | Paper |
Very large-scale neighborhood search for the quadratic assignment problem
INFORMS Journal on Computing | 2012-06-18 | Paper |
A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
Management Science | 2012-02-19 | Paper |
Solving the convex cost integer dual network flow problem
Management Science | 2012-02-19 | Paper |
Algorithms for the simple equal flow problem
Management Science | 2012-02-12 | Paper |
Single-machine scheduling with stepwise tardiness costs and release times
Journal of Industrial and Management Optimization | 2012-01-18 | Paper |
Incremental network optimization: theory and algorithms
Operations Research | 2011-11-24 | Paper |
Fast algorithms for specially structured minimum cost flow problems with applications
Operations Research | 2011-11-17 | Paper |
Lower bounding techniques for the degree-constrained network design problem
Networks | 2010-11-24 | Paper |
Network flows. Theory, algorithms, and applications.
| 2010-11-23 | Paper |
A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems
Operations Research | 2009-08-13 | Paper |
Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem
Operations Research | 2009-08-13 | Paper |
TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time
Operations Research | 2009-08-13 | Paper |
A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints
Operations Research | 2009-07-03 | Paper |
Inverse Optimization
Operations Research | 2009-07-03 | Paper |
Neighborhood search approaches to beam orientation optimization in intensity modulated radiation therapy treatment planning
Journal of Global Optimization | 2009-05-04 | Paper |
Optimal network configuration and capacity expansion of railroads
The Journal of the Operational Research Society | 2008-08-14 | Paper |
New approaches for solving the block‐to‐train assignment problem
Networks | 2008-01-08 | Paper |
Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem
Journal of Heuristics | 2006-05-29 | Paper |
A Column Generation Approach to Radiation Therapy Treatment Planning Using Aperture Modulation
SIAM Journal on Optimization | 2005-09-16 | Paper |
A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy
Networks | 2005-02-23 | Paper |
A neighborhood search algorithm for the combined through and fleet assignment model with time windows
Networks | 2005-01-12 | Paper |
A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
Algorithmica | 2004-12-13 | Paper |
scientific article; zbMATH DE number 2050792 (Why is no real title available?)
| 2004-03-07 | Paper |
Dynamic shortest paths minimizing travel times and costs
Networks | 2003-07-31 | Paper |
Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights
Transportation Science | 2003-06-29 | Paper |
A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
Operations Research Letters | 2003-06-17 | Paper |
A network simplex algorithm with O(\(n\)) consecutive degenerate pivots
Operations Research Letters | 2003-04-02 | Paper |
Combinatorial algorithms for inverse network flow problems
Networks | 2003-03-19 | Paper |
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics | 2002-09-17 | Paper |
Solving inverse spanning tree problems through network flow techniques
Operations Research | 2002-02-07 | Paper |
New polynomial-time cycle-canceling algorithms for minimum-cost flows
| 2001-10-04 | Paper |
A Faster Algorithm for the Inverse Spanning Tree Problem
Journal of Algorithms | 2001-09-10 | Paper |
Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
Mathematical Programming. Series A. Series B | 2001-01-01 | Paper |
A greedy genetic algorithm for the quadratic assignment problem
Computers \& Operations Research | 2000-09-04 | Paper |
The balanced linear programming problem
European Journal of Operational Research | 2000-01-18 | Paper |
scientific article; zbMATH DE number 1342118 (Why is no real title available?)
| 1999-09-22 | Paper |
Diagnosing infeasibilities in network flow problems
Mathematical Programming. Series A. Series B | 1999-09-05 | Paper |
Computational investigations of maximum flow algorithms
European Journal of Operational Research | 1999-02-22 | Paper |
A polynomial-time algorithm for message routing in hierarchical communication networks
European Journal of Operational Research | 1998-11-05 | Paper |
Optimal expansion of capacitated transshipment networks
European Journal of Operational Research | 1998-10-07 | Paper |
scientific article; zbMATH DE number 1175957 (Why is no real title available?)
| 1998-07-19 | Paper |
A new pivot selection rule for the network simplex algorithm
Mathematical Programming. Series A. Series B | 1998-06-22 | Paper |
Equivalence of the primal and dual simplex algorithms for the maximum flow problem
Operations Research Letters | 1997-08-05 | Paper |
Use of Representative Operation Counts in Computational Testing of Algorithms
INFORMS Journal on Computing | 1997-05-20 | Paper |
Improved Algorithms for Bipartite Network Flow
SIAM Journal on Computing | 1996-07-04 | Paper |
A capacity scaling algorithm for the constrained maximum flow problem
Networks | 1995-09-27 | Paper |
New scaling algorithms for the assignment and minimum mean cycle problems
Mathematical Programming. Series A. Series B | 1992-09-26 | Paper |
Finding minimum-cost flows by double scaling
Mathematical Programming. Series A. Series B | 1992-06-28 | Paper |
The Scaling Network Simplex Algorithm
Operations Research | 1992-06-28 | Paper |
Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems
| 1991-01-01 | Paper |
Some Recent Advances in Network Flows
SIAM Review | 1991-01-01 | Paper |
Faster algorithms for the shortest path problem
Journal of the ACM | 1990-01-01 | Paper |
Improved Time Bounds for the Maximum Flow Problem
SIAM Journal on Computing | 1989-01-01 | Paper |
A Fast and Simple Algorithm for the Maximum Flow Problem
Operations Research | 1989-01-01 | Paper |
Minimum cost-reliability ratio path problem
Computers \& Operations Research | 1988-01-01 | Paper |
Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
Transportation Science | 1987-01-01 | Paper |
New lower planes for the network design problem
Networks | 1987-01-01 | Paper |
Algorithms for the minimax transportation problem
Naval Research Logistics Quarterly | 1986-01-01 | Paper |
Minimax linear programming problem
Operations Research Letters | 1985-01-01 | Paper |
A parametric algorithm for convex cost network flow and related problems
European Journal of Operational Research | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3819489 (Why is no real title available?)
| 1983-01-01 | Paper |
scientific article; zbMATH DE number 3807373 (Why is no real title available?)
| 1983-01-01 | Paper |
scientific article; zbMATH DE number 3724223 (Why is no real title available?)
| 1981-01-01 | Paper |
