A tag is a keyword or label that categorizes your question with other, similar questions. Using the right tags makes it easier for others to find and answer your question.
For questions about solving Operations Research problems using the C++ programming language.
For questions about optimization problems in which one or more parameters are stochastic, with known probability distributions or discrete scenarios. The goal is often, but not always, to minimize or …
For questions related to algorithms expected to produce good solutions, with no guarantee of optimality, in relatively short computation time.
Questions related to resources (e.g. data, results, code) that can be downloaded freely from the Internet.
Questions relevant to the PuLP modelling framework in Python
Questions on general heuristic strategies that can be instantiated for a specific problem to obtain a heuristic.
For questions related to the branch-and-bound method for integer programming problems, which recursively divides the solution space and identifies upper and lower bounds on the optimal objective funct…
For questions related to the use of computer models to estimate performance measures for complex systems, typically under uncertainty.
For questions related to the formulation or solution methodologies of network flow problems. Some of the well-known network flow problems are maximum flow problem, minimum-cost flow problem, and multi…
For questions related to probability distributions, functions that relate a given value to the likelihood that a random variable will take that value.
For questions related to machine learning (ML), a type of algorithm that attempts to "learn" how to perform a task without being given an explicit set of rules to follow in order to perform it. Questi…
For questions related to the algebraic modeling language AMPL.
Questions related to the IBM Decision Optimization CPLEX (docplex) which is designed for modeling and solving optimization problems in Python.
For questions related to Benders decomposition, a type of optimization algorithm in which certain variables are optimized in a "master problem," the values of those variables are fixed, the remaining …
Questions on problems whose solution space are one-to-one mappings between two sets.
For questions relating to Operations Research in academic settings.
For questions about obtaining upper or lower bounds for certain values, usually for an optimization objective.
For questions about solving Operations Research problems using the Java programming language.
For questions specifically about existence (feasibility), counting feasible points (in a discrete setting), or partitioning the feasible region (e.g. in the context of branch-and-bound methods). Feasi…
For questions on constraints controlled by binary variables.
For questions about mathematical optimization problems with continuous and discrete variables and nonlinear functions in the objective function and/or the constraints. Should be synonymous with mixed-…
For questions related to optimization problems for choosing the optimal locations of facilities such as warehouses, factories, fire stations, etc.
For questions on first-order necessary conditions for optimality in non-linear programs due to Karush, Kuhn, and Tucker.
For questions related to the knapsack problem that seeks to find the number of each item to include in a limited container (in an integer knapsack or whether to include an item in a binary knapsack),…
For questions about solving Operations Research problems using Matlab programming language.
For questions about the definition or meaning of terms used within Operations Research.
For questions about dynamic programming, a mathematical optimization technique where the optimal solution to the problem is found by breaking it down to simpler sub-problems and solved recursively.
For questions related to Markov decision processes (MDPs), which model decision making in time-varying and usually stochastic environments.
Questions on algorithms that combine branch-and-bound search and the generation of cutting planes.
For questions about standard test instances for evaluating the performance of Operations Research models or algorithms.
For questions on the set of points that satisfy a finite set of linear inequalities.
For questions related to the set covering problem. Having a set of elements, S, and a collection of sets whose union equals S, the set covering problem tries to identify the smallest sub-collection of…
For questions relating to the relaxation of linear integer or mixed-integer-linear programming (MILP) problems where the integer constraints are removed.