Result 1 to 20 of 3654 total
Wavelength assignment for reducing in-band crosstalk attack propagation in optical networks: ILP formulations and heuristic algorithms. (English)
Eur. J. Oper. Res. 222, No. 3, 418-429 (2012).
1
Simple matching vs linear assignment in scheduling models with positional effects: a critical review. (English)
Eur. J. Oper. Res. 222, No. 3, 393-407 (2012).
2
A new exact discrete linear reformulation of the quadratic assignment problem. (English)
Eur. J. Oper. Res. 220, No. 2, 314-319 (2012).
3
A tale of three eras: the discovery and rediscovery of the Hungarian method. (English)
Eur. J. Oper. Res. 219, No. 3, 641-651 (2012).
4
The dominance assignment problem. (English)
Discrete Optim. 9, No. 3, 149-158 (2012).
5
A study on the coordination of urban traffic control and traffic assignment. (English)
Discrete Dyn. Nat. Soc. 2012, Article ID 367468, 12 p. (2012).
6
Three ideas for the quadratic assignment problem. (English)
Oper. Res. 60, No. 4, 954-964 (2012).
7
A generalization of chromatic polynomial of a graph subdivision. (English)
J. Math. Sci., New York 182, No. 2, 246-254 (2012); translation from Sovrem. Mat. Prilozh. 71 (2011).
8
ML with PTIME complexity guarantees. (English)
Cégielski, Patrick (ed.) et al., Computer science logic (CSL’12). 26th international workshop, 21th annual conference of the EACSL, September 3‒6, 2012, Fontainebleau, France. Selected papers based on the presentations at the conference. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-42-2). LIPICS ‒ Leibniz International Proceedings in Informatics 16, 198-212, electronic only (2012).
9
Exact and approximation algorithms for geometric and capacitated set cover problems. (English)
Algorithmica 64, No. 2, 295-310 (2012).
10
Types of maximum noninteger vertices of the relaxation polyhedron of the four-index axial assignment problem. (English)
Russ. Math. 56, No. 3, 6-13 (2012); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2012, No. 3, 9-16 (2012).
11
Measuring instance difficulty for combinatorial optimization problems. (English)
Comput. Oper. Res. 39, No. 5, 875-889 (2012).
12
The dynamic space allocation problem: applying hybrid GRASP and tabu search metaheuristics. (English)
Comput. Oper. Res. 39, No. 3, 671-677 (2012).
13
An improved reduction method for the robust optimization of the assignment problem. (English)
Asia-Pac. J. Oper. Res. 29, No. 5, 1250032,14p. (2012).
14
Variable neighborhood descent with iterated local search for routing and wavelength assignment. (English)
Comput. Oper. Res. 39, No. 9, 2133-2141 (2012).
15
PSO assisted NURB neural network identification. (English)
Huang, De-Shuang (ed.) et al., Intelligent computing technology. 8th international conference, ICIC 2012, Huangshan, China, July 25‒29, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31587-9/pbk). Lecture Notes in Computer Science 7389, 1-9 (2012).
16
Towards a self-selective and self-healing evaluation. (English)
Okumura, Manabu (ed.) et al., New frontiers in artificial intelligence. JSAI-isAI 2011 workshops, LENLS, JURISIN, ALSIP, MiMI, Takamatsu, Japan, December 1‒2, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-32089-7/pbk). Lecture Notes in Computer Science 7258. Lecture Notes in Artificial Intelligence, 96-109 (2012).
17
Another well-solvable case of the QAP: maximizing the job completion time variance. (English)
Oper. Res. Lett. 40, No. 5, 356-359 (2012).
18
Models and algorithms for the train unit assignment problem. (English)
Mahjoub, A. Ridha (ed.) et al., Combinatorial optimization. Second international symposium, ISCO 2012, Athens, Greece, April 19-21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-32146-7/pbk). Lecture Notes in Computer Science 7422, 24-35 (2012).
19
A construction of large graphs of diameter two and given degree from abelian lifts of dipoles. (English)
Kybernetika 48, No. 3, 518-521 (2012).
20
Result 1 to 20 of 3654 total
Start
Contact
Print
General Help
