Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with combinatorial-optimization
Search options not deleted
user 51
For questions about optimization over a discrete solution space.
3
votes
How to modify EMSR when capacity for each fare class is different
EMSR heuristics are discussed on page 161 of "Pricing and Revenue Optimization", by Robert Lewis Phillips.
"7.3.2 Expected Marginal Seat Revenue (EMSR) Heuristics
Expected marginal seat reve …
- 2,130
7
votes
Two-stage $k$-means clustering
Two stage k-means is discussed in:
"Balanced K-Means Algorithm for Partitioning Areas in Large-Scale Vehicle Routing Problem" (Dec 2009), by Ruhan He, Weibin Xu, Jiaxia Sun, and Bingqiao Zu
"Solving …
- 2,130
-1
votes
Modeling the Choose function
From Wikipedia's webpage on "binomial coefficients":
"The symbol $\tbinom {n}{k}$ is usually read as "$n$ choose $k$" because there are $\tbinom {n}{k}$ ways to choose an (unordered) subset of $k$ el …
- 2,130