Pages that link to "Item:Q4027781"
From MaRDI portal
The following pages link to The Fixed-Outdegree 1-Arborescence Polytope (Q4027781):
Displaying 8 items.
- A complete characterization of jump inequalities for the hop-constrained shortest path problem (Q528561) (← links)
- Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
- Facets of two Steiner arborescence polyhedra (Q1181904) (← links)
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. (Q1406627) (← links)
- Capacitated ring arborescence problems with profits (Q2284638) (← links)
- A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets (Q2367914) (← links)
- A polyhedral study of the asymmetric traveling salesman problem with time windows (Q4519128) (← links)
- The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints (Q5946820) (← links)
