Tags

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.

× 72
For questions about mathematical optimization problems involving both continuous and binary or general integer variables.
× 63
For questions involving mathematical problems that aim to minimize or maximize some objective function, possibly subject to one or more constraints.
× 59
For questions related to problems that optimize (i.e., minimize or maximize) a linear objective subject to linear constraints.
× 45
For questions related to the process of converting a real-world problem into a mathematical model. Can include questions related to linearization, logical constraints, tightness of formulations, and s…
× 25
For questions asking for references from the literature or textbooks on specific topics.
× 23
For questions related to software designed to solve very general classes of optimization problems to guaranteed optimality.
× 22
For questions about mathematical optimization problems involving binary or general integer variables.
× 21
For questions about optimization over a discrete solution space.
× 20
Questions related to the commercial solver IBM ILOG CPLEX Optimization Studio.
× 18
For questions related to constraints, i.e. any restriction or relation a set of decision variables has to satisfy.
× 18
For questions about mathematical optimization problems involving a nonlinear objective function and/or nonlinear constraints.
× 17
For questions related to techniques for converting nonlinear expressions in optimization models into equivalent (or approximately equivalent) linear ones.
× 14
For questions on modeling satisfaction or optimization problems in languages designed for expressing (often high-level) constraints on decision variables.
× 13
Questions related to resources (e.g. data, results, code) that can be downloaded freely from the Internet.
× 12
For questions related to the design or implementation of algorithms (exact or heuristic) for solving optimization problems.
× 12
For questions about solving Operations Research problems using the Python programming language.
× 12
For questions asking for real-world applications of specific concepts.
× 9
For questions related to commercial or open-source computer software used for operations research problems.
× 9
For questions about the theoretical runtime needed for solving computational problems, often measured in the size of the input. This includes questions about whether polynomial time algorithms exist, …
× 9
For questions related to the Python optimization modeling package Pyomo.
× 9
For questions about constraints that can be expressed in (usually propositional) logic.
× 9
For questions on quadratic programming, methods to solve them and related solvers. Use this tag along with (optimization).
× 9
For questions about mathematical models and algorithms for optimizing inventories.
× 9
Questions related to the commercial solver Gurobi Optimizer.
× 8
For questions related to graphs, a mathematical object consisting of a set of nodes with edges connecting certain pairs of them.
× 8
For questions about methods that assign resources to work requests (e.g. processor time to tasks) usually minimizing some cost measure (e.g. makespan).
× 8
For questions related to optimization problems for routing vehicles through a set of nodes, especially the vehicle routing problem (VRP) and its variants.
× 7
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…
× 7
For questions about the definition or meaning of terms used within Operation Research.
× 7
For questions related to the use of computer models to estimate performance measures for complex systems, typically under uncertainty.
× 6
× 6
Questions on general heuristic strategies that can be instantiated for a specific problem to obtain a heuristic.
× 6
For questions related to the simplex method for linear programming (LP), which solves LPs optimally by moving iteratively from in corner point of the feasible region to a better one.
× 6
For questions related to the traveling salesman problem (TSP), which seeks, for a given set of nodes, the shortest path that visits every node and returns to the starting node.
× 6
expected to produce good solutions, with no guarantee of optimality, in relatively short computation time.
× 6
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 …