The following pages link to (Q4509378):
Displayed 11 items.
- A penalty search algorithm for the obstacle neutralization problem (Q337275) (← links)
- A complete characterization of jump inequalities for the hop-constrained shortest path problem (Q528561) (← links)
- Characterization of facets of the hop constrained chain polytope via dynamic programming (Q741741) (← links)
- Some observations about the extreme points of the generalized cardinality-constrained shortest path problem polytope (Q941053) (← links)
- On cardinality constrained cycle and path polytopes (Q964176) (← links)
- Facets of the \((s,t)-p\)-path polytope (Q967368) (← links)
- A column generation heuristic for a dynamic generalized assignment problem (Q1010279) (← links)
- On the directed hop-constrained shortest path problem (Q1433652) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- An optimal algorithm for the obstacle neutralization problem (Q2628188) (← links)
- The cardinality constrained inverse center location problems on tree networks with edge length augmentation (Q2661775) (← links)