The following pages link to (Q4739657):
Displayed 50 items.
- ``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation (Q992654) (← links)
- Rake linking for suburban train services (Q998693) (← links)
- An assignment-based heuristic for vehicle routing with time windows (Q1001380) (← links)
- Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions (Q1002052) (← links)
- The subdivision-constrained minimum spanning tree problem (Q1006063) (← links)
- Dealing with label switching in mixture models under genuine multimodality (Q1006666) (← links)
- A complexity tradeoff in ranking-function termination proofs (Q1006896) (← links)
- Parallel ILP for distributed-memory architectures (Q1009328) (← links)
- Computing and minimizing the relative regret in combinatorial optimization with interval data (Q1019293) (← links)
- GRAFT, a complete system for data fusion (Q1020856) (← links)
- A survey on metaheuristics for stochastic combinatorial optimization (Q1024034) (← links)
- Greedily constructing maximal partial \(f\)-factors (Q1025473) (← links)
- On the design of correct and optimal dynamical systems and games (Q1028979) (← links)
- On visualization scaling, subeigenvectors and Kleene stars in max algebra (Q1039747) (← links)
- Subclasses of solvable problems from classes of combinatorial optimization problems (Q1040379) (← links)
- Using a greedy random adaptative search procedure to solve the cover printing problem (Q1040963) (← links)
- A primal-dual simplex algorithm for bi-objective network flow problems (Q1041407) (← links)
- Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187) (← links)
- Interactive construction of graphical decision models based on causal mechanisms (Q1042252) (← links)
- Asymptotics of the minimum manipulating coalition size for positional voting rules under impartial culture behaviour (Q1042332) (← links)
- A memetic algorithm for graph coloring (Q1043356) (← links)
- The complexity of determining a shortest cycle of even length (Q1052821) (← links)
- The complexity of facets (and some facets of complexity) (Q1061485) (← links)
- A successful algorithm for the undirected Hamiltonian path problem (Q1061488) (← links)
- An approach to the subgraph homeomorphism problem (Q1062457) (← links)
- An analysis of a decomposition heuristic for the assignment problem (Q1062912) (← links)
- A matching problem in the plane (Q1064790) (← links)
- Concerning the achromatic number of graphs (Q1065819) (← links)
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem (Q1068731) (← links)
- Games against nature (Q1069296) (← links)
- On negative cycles in mixed graphs (Q1071027) (← links)
- A lower bound to the complexity of Euclidean and rectilinear matching algorithms (Q1072708) (← links)
- The complexity of analog computation (Q1077163) (← links)
- Randomized algorithms in combinatorial optimization: A survey (Q1077329) (← links)
- Scaling algorithms for network problems (Q1079135) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- A condition for the strong regularity of matrices in the minimax algebra (Q1082274) (← links)
- An algorithm for shortest-path motion in three dimensions (Q1082820) (← links)
- The hierarchical network design problem (Q1083378) (← links)
- Complexity of certain decision problems about congruential languages (Q1085618) (← links)
- A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784) (← links)
- A Lagrangean relaxation method for the constrained assignment problem (Q1086162) (← links)
- Representability in mixed integer programming. I: Characterization results (Q1089258) (← links)
- Strong linear independence in bottleneck algebra (Q1094338) (← links)
- Karmarkar's algorithm and the ellipsoid method (Q1095025) (← links)
- Structural analysis of local search heuristics in combinatorial optimization (Q1095797) (← links)
- Scheduling jobs with fixed start and end times (Q1098765) (← links)
- Fractional matchings and the Edmonds-Gallai theorem (Q1098861) (← links)
- Complexity of matching problems (Q1099615) (← links)
- Communication complexity of convex optimization (Q1100896) (← links)