The following pages link to (Q4130999):
Displaying 38 items.
- The shortest path problem with forbidden paths (Q146692) (← links)
- Multistable selection equations of pattern formation type in the case of inhomogeneous growth rates: With applications to two-dimensional assignment problems (Q432929) (← links)
- The traveling salesman problem with flexible coloring (Q444446) (← links)
- On the structure of the \(h\)-vector of a paving matroid (Q449206) (← links)
- On finding optimal polytrees (Q500966) (← links)
- Approximating \(k\)-spanner problems for \(k>2\) (Q557826) (← links)
- Shortest path and maximum flow problems in networks with additive losses and gains (Q620954) (← links)
- Relay placement for fault tolerance in wireless networks in higher dimensions (Q632722) (← links)
- A combinatoric interpretation of dual variables for weighted matching and \(f\)-factors (Q714819) (← links)
- A hybrid genetic algorithm for the three-index assignment problem (Q818096) (← links)
- Necessary and sufficient conditions of optimality for some classical scheduling problems (Q852941) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Incremental assignment problem (Q865928) (← links)
- Boundary labeling: Models and efficient algorithms for rectangular maps (Q868108) (← links)
- Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks (Q932187) (← links)
- A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem (Q932651) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- On the approximability of minmax (regret) network optimization problems (Q976089) (← links)
- Network flow interdiction on planar graphs (Q987697) (← links)
- Capacitated procurement planning with price-sensitive demand and general concave-revenue functions (Q1002053) (← links)
- Preemptive scheduling on uniform machines to minimize mean flow time (Q1017456) (← links)
- Structure and dimension of the eigenspace of a concave Monge matrix (Q1028473) (← links)
- Maximum weight bipartite matching in matrix multiplication time (Q1035683) (← links)
- Choosing robust solutions in discrete optimization problems with fuzzy costs (Q1037888) (← links)
- Some methods for evaluating the optimality of elements in matroids with ill-known weights (Q1037947) (← links)
- A note on the single machine scheduling to minimize the number of tardy jobs with deadlines (Q1038367) (← links)
- Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187) (← links)
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights (Q1044085) (← links)
- Computing latest starting times of activities in interval-valued networks with minimal time lags (Q1044116) (← links)
- Two flow network simplification algorithms (Q1045934) (← links)
- Complement reducible graphs (Q1153105) (← links)
- On-line computation of minimal and maximal length paths (Q1184981) (← links)
- Testing the necklace condition for shortest tours and optimal factors in the plane (Q1262765) (← links)
- Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data (Q1767979) (← links)
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example (Q1771343) (← links)
- Competitive location, production, and market selection (Q1811158) (← links)
- Future paths for integer programming and links to artificial intelligence (Q1821034) (← links)
- An extension of Christofides heuristic to the k-person travelling salesman problem (Q1838426) (← links)
