Changes in lemon/grosso_locatelli_pullan_mc.h [1022:8583fb74238c:1270:dceba191c00d] in lemon
- File:
-
- 1 edited
-
lemon/grosso_locatelli_pullan_mc.h (modified) (15 diffs)
Legend:
- Unmodified
- Added
- Removed
-
lemon/grosso_locatelli_pullan_mc.h
r1022 r1270 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 2003-201 05 * Copyright (C) 2003-2013 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). … … 41 41 /// \ref GrossoLocatelliPullanMc implements the iterated local search 42 42 /// algorithm of Grosso, Locatelli, and Pullan for solving the \e maximum 43 /// \e clique \e problem \ refgrosso08maxclique.43 /// \e clique \e problem \cite grosso08maxclique. 44 44 /// It is to find the largest complete subgraph (\e clique) in an 45 45 /// undirected graph, i.e., the largest set of nodes where each … … 121 121 BoolMatrix _gr; 122 122 int _n; 123 123 124 124 // Search options 125 125 bool _delta_based_restart; 126 126 int _restart_delta_limit; 127 127 128 128 // Search limits 129 129 int _iteration_limit; … … 443 443 /// \name Execution Control 444 444 /// The \ref run() function can be used to execute the algorithm.\n 445 /// The functions \ref iterationLimit(int), \ref stepLimit(int), and 445 /// The functions \ref iterationLimit(int), \ref stepLimit(int), and 446 446 /// \ref sizeLimit(int) can be used to specify various limits for the 447 447 /// search process. 448 448 449 449 /// @{ 450 450 451 451 /// \brief Sets the maximum number of iterations. 452 452 /// … … 460 460 /// likely finds larger cliques. For smaller values, the algorithm is 461 461 /// faster but probably gives worse results. 462 /// 462 /// 463 463 /// The default value is \c 1000. 464 464 /// \c -1 means that number of iterations is not limited. … … 475 475 return *this; 476 476 } 477 477 478 478 /// \brief Sets the maximum number of search steps. 479 479 /// … … 487 487 /// likely finds larger cliques. For smaller values, the algorithm is 488 488 /// faster but probably gives worse results. 489 /// 489 /// 490 490 /// The default value is \c -1, which means that number of steps 491 491 /// is not limited explicitly. However, the number of iterations is … … 503 503 return *this; 504 504 } 505 505 506 506 /// \brief Sets the desired clique size. 507 507 /// … … 509 509 /// limit. If a clique of this size (or a larger one) is found, then the 510 510 /// algorithm terminates. 511 /// 511 /// 512 512 /// This function is especially useful if you know an exact upper bound 513 /// for the size of the cliques in the graph or if any clique above 513 /// for the size of the cliques in the graph or if any clique above 514 514 /// a certain size limit is sufficient for your application. 515 /// 515 /// 516 516 /// The default value is \c -1, which means that the size limit is set to 517 517 /// the number of nodes in the graph. … … 525 525 return *this; 526 526 } 527 527 528 528 /// \brief The maximum number of iterations. 529 529 /// … … 535 535 return _iteration_limit; 536 536 } 537 537 538 538 /// \brief The maximum number of search steps. 539 539 /// … … 545 545 return _step_limit; 546 546 } 547 547 548 548 /// \brief The desired clique size. 549 549 /// … … 584 584 /// \name Query Functions 585 585 /// The results of the algorithm can be obtained using these functions.\n 586 /// The run() function must be called before using them. 586 /// The run() function must be called before using them. 587 587 588 588 /// @{ … … 677 677 678 678 private: 679 679 680 680 // Initialize search options and limits 681 681 void initOptions() { … … 683 683 _delta_based_restart = true; 684 684 _restart_delta_limit = 4; 685 685 686 686 // Search limits 687 687 _iteration_limit = 1000;
Note: See TracChangeset
for help on using the changeset viewer.
