|
Search the dblp DataBase
Dragan Urosevic:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Zoran Ognjanovic, Dragan Urosevic, Tatjana Petrovic, Zorana Ristovic
A Tableaux Retlated Method for Modal Theorem Proving (Extended Abstract). [Citation Graph (0, 0)][DBLP] TABLEAUX, 1992, pp:61-63 [Conf]
- Nenad Mladenovic, Frank Plastria, Dragan Urosevic
Reformulation descent applied to circle packing problems. [Citation Graph (0, 0)][DBLP] Computers & OR, 2005, v:32, n:, pp:2419-2434 [Journal]
- Dragan Urosevic, Jack Brimberg, Nenad Mladenovic
Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem. [Citation Graph (0, 0)][DBLP] Computers & OR, 2004, v:31, n:8, pp:1205-1213 [Journal]
- Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
Variable neighborhood search and local branching. [Citation Graph (0, 0)][DBLP] Computers & OR, 2006, v:33, n:10, pp:3034-3045 [Journal]
- Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
Variable neighborhood search for the maximum clique. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2004, v:145, n:1, pp:117-125 [Journal]
- Jack Brimberg, Dragan Urosevic, Nenad Mladenovic
Variable neighborhood search for the vertex weighted k. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2006, v:171, n:1, pp:74-84 [Journal]
- Nenad Mladenovic, Frank Plastria, Dragan Urosevic
Formulation Space Search for Circle Packing Problems. [Citation Graph (0, 0)][DBLP] SLS, 2007, pp:212-216 [Conf]
Variable neighborhood search for the heaviest k-subgraph. [Citation Graph (, )][DBLP]
A restarted and modified simplex search for unconstrained optimization. [Citation Graph (, )][DBLP]
Variable neighbourhood decomposition search for 0-1 mixed integer programs. [Citation Graph (, )][DBLP]
Solving large p-median clustering problems by primal-dual variable neighborhood search. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|