Basic OR algorithms such as LP, MILP, MDP
Operations Research Scientist Interview Questions
85 operations research scientist interview questions shared by candidates
The open question of vehicle routing problem is pretty hard for some one whose research is not focus on this specific area.
First one with the Manager of the team. He asked me about my research work and gave me one dynamic programming coding problem. Then asked 2 behavioral questions. Next day I attend another interview with one of the team members. He gave me a problem and asked to compute linear programming. Then asked about some famous optimization algorithms.
coding experience in python. OR experience
I was described a scenario where one might wish to detect some type of spike event on a timeline.
Mathematical modeling questions
In an undirected connected graph G = (N, A), an Euler tour is a walk that starts at some node, visits each arc exactly once, and returns to the starting node. A graph is Eulerian if it contains an Euler tour. Show that in an Eulerian graph, the degree of every node is even. Next, show that if every node in a connected graph has an even degree, the graph is Eulerian. Establish the second result by describing an O(m) algorithm for determining whether a graph is Eulerian and, if so, will construct an Euler tour. (Hint: Describe an algorithm that decomposes any graph with only even-degree nodes into a collection of arc-disjoint cycles, and then converts the cycles into an Euler tour.)
At the beginning of a dinner party, several participants shake hands with each other. Show that the participants that shook hands an odd number of times must be even in number.
Related to fundamentals of operations research
What does this sql query do? In the data, if X cannot change and Y depends on X, yet Y changes. How do you explain the change in Y? What assumptions would you build into a model predicting results of entry into the Asian market?
Viewing 61 - 70 interview questions