Covering edges in networks | 0 | 0.34 | 2020 |
Planar multifacility location problems with tree structure and finite dominating sets. | 0 | 0.34 | 2019 |
Complexity results on planar multifacility location problems with forbidden regions | 0 | 0.34 | 2019 |
Ranking robustness and its application to evacuation planning. | 0 | 0.34 | 2018 |
Minimizing the number of apertures in multileaf collimator sequencing with field splitting. | 0 | 0.34 | 2018 |
Sink location to find optimal shelters in evacuation planning. | 0 | 0.34 | 2016 |
SI: disaster risk management. | 0 | 0.34 | 2016 |
On the generality of the greedy algorithm for solving matroid base problems | 0 | 0.34 | 2015 |
Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning. | 10 | 0.67 | 2013 |
On the generality of the greedy algorithm for solving matroid problems. | 0 | 0.34 | 2013 |
On generalized balanced optimization problems | 3 | 0.45 | 2011 |
The multi terminal q-FlowLoc problem: a heuristic | 1 | 0.40 | 2011 |
Scheduling two agents on uniform parallel machines with makespan and cost functions | 6 | 0.47 | 2011 |
On Universal Shortest Paths. | 2 | 0.37 | 2010 |
Minimum cut bases in undirected networks | 4 | 0.39 | 2010 |
Capacity inverse minimum cost flow problem | 6 | 0.49 | 2010 |
A New Sequential Extraction Heuristic for Optimizing the Delivery of Cancer Radiation Treatment Using Multileaf Collimators | 3 | 0.41 | 2009 |
A Survey on Multiple Objective Minimum Spanning Tree Problems | 12 | 0.57 | 2009 |
The Continuous Stop Location Problem in Public Transportation Networks. | 13 | 1.18 | 2009 |
Valid inequalities for binary linear codes | 5 | 0.46 | 2009 |
An optimal O(nlogn) algorithm for finding an enclosing planar rectilinear annulus of minimum width | 6 | 0.64 | 2009 |
Simultaneous scheduling and location (ScheLoc): the planar ScheLoc makespan problem | 5 | 0.55 | 2009 |
Mathematical optimization in intensity modulated radiation therapy | 33 | 1.61 | 2008 |
New trends in locational analysis | 0 | 0.34 | 2008 |
Finding representative systems for discrete bicriterion optimization problems | 27 | 1.29 | 2007 |
Multiple objective minimum cost flow problems: A review | 17 | 1.33 | 2007 |
Consecutive Ones Decomposition of Integer Matrices and Applications | 0 | 0.34 | 2006 |
Algorithms for time-dependent bicriteria shortest path problems | 7 | 0.95 | 2006 |
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints | 16 | 1.19 | 2006 |
A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy | 38 | 2.53 | 2005 |
Special section: Using discrete mathematics to model multileaf collimators in radiation therapy | 3 | 0.41 | 2005 |
Decomposition of integer matrices and multileaf collimator sequencing | 44 | 2.51 | 2005 |
Decomposition of consecutive-1 matrices and applications | 0 | 0.34 | 2004 |
Design of Zone Tariff Systems in Public Transportation | 7 | 1.47 | 2004 |
Adapting polyhedral properties from facility to hub location problems | 52 | 2.23 | 2004 |
Minimizing beam-on time in cancer radiation treatment using multileaf collimators | 42 | 6.79 | 2004 |
On Center Cycles in Grid Graphs | 1 | 0.35 | 2003 |
Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives | 8 | 0.55 | 2002 |
Locating New Stops in a Railway Network. | 26 | 2.68 | 2001 |
Solving Nonconvex Planar Location Problems by Finite Dominating Sets | 5 | 0.76 | 2000 |
Planar Weber Location Problems with Barriers and Block Norms | 12 | 1.29 | 2000 |
Geometric methods to solve max-ordering location problems | 8 | 0.86 | 1999 |
Multicriteria network location problems with sum objectives. | 15 | 1.54 | 1999 |
A note on center problems with forbidden polyhedra | 7 | 0.99 | 1997 |
A note onK best network flows | 10 | 0.82 | 1995 |
On spanning tree problems with multiple objectives | 58 | 6.10 | 1994 |
Note on combinatorial optimization with max-linear objective functions | 5 | 1.99 | 1993 |
Color constrained combinatorial optimization problems | 1 | 0.38 | 1991 |
Theoretical and Computational Aspects of Simulated Annealing (P. J. M. van Laarhoven E. H. L. Aarts) and Simulated Annealing: Theory and Applications (P. J. M. van Laarhoven and E. H. L. Aarts) | 1 | 0.35 | 1990 |
Intersection of two matroids: (condensed) border graphs and ranking | 10 | 1.12 | 1989 |