Top new questions this week:
|
|
Given a list of (absolute valued) pair differences ordered and with duplicates removed, how can we recover/reconstruct the list that generated these differences? We do not know anything about the ...
|
|
Reading gurobi reference manual I found this:
We have also found that certain classes of MIP models benefit from reducing the thread count, often all the way down to one thread. Starting multiple ...
|
|
For teaching purposes, I would like to solve the Travelling Salesman Problem with a column generation approach.
In the academic literature, an approach is proposed (for example here), where columns ...
|
|
I am trying to solve Exercise 2.39 at Boyd and Vandenberghe's Convex Optimization book. In one source, the answer is given as:
2.39 Separation of cones. Let $K$ and $\tilde K$ be two convex cones ...
|
|
Are there any books on Operations Research subjects by world-famous authors which have been made available for free access on the web, despite never having been "completed" to the standard to which ...
|
|
This article presents the following formulation of the best subset selection problem
$$\min_{\|\beta\|_0\leq k}\frac{1}{2}\|y-X\beta\|^2_2$$
I wonder where the $1/2$ comes from. Help appreciated.
|
|
I'm trying to write this constraint in C++ and add it to my model (addLessOrEqual):
$$\text{start}_{i}+\text{duration}_{i}\le\text{start}_{j}$$ for an $(i,j)$ arc of precedence.
Starts (IntVar) and ...
|
Greatest hits from previous weeks:
|
|
"All models are wrong, but some are useful" - George E. P. Box
I usually work on what one could call operational problems. There I usually do not have too much trouble figuring out the level of ...
|
|
Often there are many alternatives ways for formulating a MIP. For example:
The model contains inequality constraints that must hold with equality in an optimal solution.
The model contains ...
|
|
As a practical (real-world problems) point of view, it's important we could solve optimization problems as quickly as possible (for instance, to release a daily schedule).
Maybe a problem with many ...
|
|
The terms "soft constraints" and "hard constraints" are used in the context of optimization modeling.
Is there any standard way to figure out which is which in some of the complicated models?
|
|
Many abbreviations are used in Operations Research. For example, we have abbreviations for problem classes (LP, MIP), solution methods (IPM), and specific problems (TSP, VRP).
Which abbreviations are ...
|
|
It would be very useful for beginning and non technical users to be able to define models in a way that was natural for them. Further this could perhaps assist generating some kind of generic ...
|
|
In optimization literature, I frequently see solution methods termed "exact" or "approximate". (I use the term "method" here because I suspect exactness, or its lack, is a function of both algorithm ...
|
Can you answer these questions?
|
|
I'm solving a large instance using Gurobi 7.0, 64-bit version on machine with 16GB of RAM. Gurobi is stuck at the start and all the memory is exhausted. Here is the output:
5378534 variables, all ...
|
|
Given a minimum-cost flow problem, how could I go about demonstrating that a specific solution (as sets of basic and non-basic (!) arcs that build a rooted spanning tree for a given graph) is basic ...
|
|
I was reading this paper by Cerna et al. (2018)1. In the paper there are only CPLEX-solvable equations given by the authors and the results.
How valuable is this paper, and what is its quality? Can ...
|
