Result 1 to 20 of 2080 total
A bi-objective modeling approach applied to an urban semi-desirable facility location problem. (English)
Eur. J. Oper. Res. 223, No. 1, 203-213 (2012).
1
A constraint programming approach for a batch processing problem with non-identical job sizes. (English)
Eur. J. Oper. Res. 221, No. 3, 533-545 (2012).
2
Enumerating $K$ best paths in length order in DAGs. (English)
Eur. J. Oper. Res. 221, No. 2, 308-316 (2012).
3
Coupling ant colony systems with strong local searches. (English)
Eur. J. Oper. Res. 220, No. 3, 831-843 (2012).
4
Variable neighborhood search for metric dimension and minimal doubly resolving set problems. (English)
Eur. J. Oper. Res. 220, No. 2, 328-337 (2012).
5
A new exact discrete linear reformulation of the quadratic assignment problem. (English)
Eur. J. Oper. Res. 220, No. 2, 314-319 (2012).
6
A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. (English)
Eur. J. Oper. Res. 220, No. 1, 270-285 (2012).
7
A reference length approach for the 3D strip packing problem. (English)
Eur. J. Oper. Res. 220, No. 1, 37-47 (2012).
8
A tale of three eras: the discovery and rediscovery of the Hungarian method. (English)
Eur. J. Oper. Res. 219, No. 3, 641-651 (2012).
9
Matroid rank functions and discrete concavity. (English)
Japan J. Ind. Appl. Math. 29, No. 3, 535-546 (2012).
10
Equivalence of convex minimization problems over base polytopes. (English)
Japan J. Ind. Appl. Math. 29, No. 3, 519-534 (2012).
11
Simple push-relabel algorithms for matroids and submodular flows. (English)
Japan J. Ind. Appl. Math. 29, No. 3, 419-439 (2012).
12
Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested. (English)
Japan J. Ind. Appl. Math. 29, No. 3, 357-384 (2012).
13
Solving $k$-cluster problems to optimality with semidefinite programming. (English)
Math. Program. 136, No. 2 (B), 279-300 (2012).
14
Minimum entropy combinatorial optimization problems. (English)
Theory Comput. Syst. 51, No. 1, 4-21 (2012).
15
A branch-and-cut-and-price approach for the capacitated $m$-ring-star problem. (English)
Discrete Appl. Math. 160, No. 18, 2728-2741 (2012).
16
The inverse maximum flow problem under $L_k$ norms. (English)
Carpathian J. Math. 28, No. 1, 59-66 (2012).
17
Hybrid metaheuristics in combinatorial optimization: a tutorial. (English)
Dediu, Adrian-Horia (ed.) et al., Theory and practice of natural computing. First international conference, TPNC 2012, Tarragona, Spain, October 2‒4, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-33859-5/pbk). Lecture Notes in Computer Science 7505, 1-10 (2012).
18
An analog of the Cook theorem for polytopes. (English)
Russ. Math. 56, No. 8, 28-34 (2012); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2012, No. 8, 34-42 (2012).
19
An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines. (English)
Comput. Oper. Res. 39, No. 7, 1477-1486 (2012).
20
Result 1 to 20 of 2080 total
Start
Contact
Print
General Help
