Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 50 results in range #1 to #50.

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)

  1. Single Machine Scheduling to Minimize Total Weighted Late Work: Label: en
  2. A Matching Identification Problem: A Knowledge Acquisition Approach: Label: en
  3. Analyzing the Pooling Problem: Label: en
  4. On the Asymptotic Optimality of Multiprocessor Scheduling Heuristics for the Makespan Minimization Problem: Label: en
  5. Optimal Scheduling of Tasks on Identical Parallel Processors: Label: en
  6. Expressing Special Structures in an Algebraic Modeling Language for Mathematical Programming: Label: en
  7. A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups: Label: en
  8. Stability of p-Persistent CSMA/CD: Label: en
  9. Spectral Analysis of Basic TES Processes: Label: en
  10. Bounds and Approximations for Overheads in the Time to Join Parallel Forks: Label: en
  11. A Revised Stochastic Complementation Algorithm for Nearly Completely Decomposable Markov Chains: Label: en
  12. Load Balancing in Hypercube Solution of Stochastic Optimization Problems: Label: en
  13. Performance Issues for the Iterative Solution of Markov Decision Processes on Parallel Computers: Label: en
  14. Interval Graph Problems on Reconfigurable Meshes: Label: en
  15. Primal-Dual and Primal Interior Point Algorithms for General Nonlinear Programs: Label: en
  16. A Staged Primal-Dual Algorithm for Perfect b-Matching with Edge Capacities: Label: en
  17. A Graph Theory-Based Approach for Partitioning Knowledge Bases: Label: en
  18. A Relationship Between CNF and DNF Systems Derivable from Examples: Label: en
  19. A Stochastic Model for Performance Evaluation of Main Memory Resident Database Systems: Label: en
  20. Access Path Optimization in Relational Joins: Label: en
  21. Incorporating the Majority Consensus Concurrency Control Mechanism into the Database Allocation Problem: Label: en
  22. A Study of the Augmented System and Column-Splitting Approaches for Solving Two-Stage Stochastic Linear Programs by Interior-Point Methods: Label: en
  23. Ghost Image Processing for Minimum Covariance Determinants: Label: en
  24. Problem and Heuristic Space Search Strategies for Job Shop Scheduling: Label: en
  25. Solving a Class Scheduling Problem with a Genetic Algorithm: Label: en
  26. Tabu Thresholding: Improved Search by Nonmonotonic Trajectories: Label: en
  27. Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods: Label: en
  28. Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2: Label: en
  29. Parallel Algorithms for Stochastic Dynamic Programming with Continuous State and Control Variables: Label: en
  30. Parallel Search Algorithms for Discrete Optimization Problems: Label: en
  31. A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems: Label: en
  32. Comparisons Between Aggregation/Disaggregation and a Direct Algorithm for Computing the Stationary Probabilities of a Markov Chain: Label: en
  33. Efficient Computation of Probabilities of Events Described by Order Statistics and Applications to Queue Inference: Label: en
  34. Disjoint Paths in the Plane: Label: en
  35. Hulls and Efficient Sets for the Rectilinear Norm: Label: en
  36. Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis: Label: en
  37. Preprocessing in Stochastic Programming: The Case of Capacitated Networks: Label: en
  38. Numerical Inversion of Laplace Transforms of Probability Distributions: Label: en
  39. The Distribution Problem with Carrier Service: A Dual Based Penalty Approach: Label: en
  40. A GRASP for the Vehicle Routing Problem with Time Windows: Label: en
  41. A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems: Label: en
  42. A Numerical Method for Controlled Routing in Large Trunk Line Networks via Stochastic Control Theory: Label: en
  43. A Newton Based Radius Reduction Algorithm for Nearest Point Problems in Pos Cones: Label: en
  44. Consistency in Valuation-Based Systems: Label: en
  45. Feature Article—Visualization and Optimization: Label: en
  46. Preprocessing and Probing Techniques for Mixed Integer Programming Problems: Label: en
  47. An EP Algorithm for Computing a Minimum Weight Perfect Matching for a Set of Points on the Plane: Label: en
  48. A Computational Study of Satisfiability Algorithms for Propositional Logic: Label: en
  49. A Structured Expert System for Model Management in Inventory Control: Label: en
  50. Optimization of Simulation via Quasi-Newton Methods: Label: en

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:EntityUsage/Q3993661"
Powered by MediaWiki