A nonmonotone GRASP
From MaRDI portal
Publication:340011
DOI10.1007/s12532-016-0107-9zbMath1349.90710OpenAlexW2464498505MaRDI QIDQ340011
Marianna De Santis, Paola Festa, Stefano Lucidi, Francesco Rinaldi, Giampaolo Liuzzi
Publication date: 11 November 2016
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11577/3188023
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The max-cut problem on graphs not contractible to \(K_ 5\)
- A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- A survey for the quadratic assignment problem
- Heuristics for the mirrored traveling tournament problem
- Scatter search for the single source capacitated facility location problem
- A GRASP algorithm for the multi-criteria minimum spanning tree problem
- Reactive GRASP for the strip-packing problem
- A probabilistic heuristic for a computationally difficult set covering problem
- Weakly bipartite graphs and the max-cut problem
- Optimization, approximation, and complexity classes
- Generating quadratic assignment test problems with known optimal permutations
- Approximation algorithms for combinatorial problems
- A GRASP for the biquadratic assignment problem
- QAPLIB - a quadratic assignment problem library
- Variable neighborhood search
- Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.
- Approximating satisfiable satisfiability problems
- Efficient solutions for the far from most string problem
- Greedy randomized adaptive search procedures
- Heuristics and meta-heuristics for 2-layer straight line crossing minimization
- Probability distribution of solution time in GRASP: an experimental investigation
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
- Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
- Breakout local search for the quadratic assignment problem
- A biased random-key genetic algorithm for data clustering
- Balancing and scheduling tasks in assembly lines with sequence-dependent setup times
- TTT plots: a perl program to create time-to-target plots
- On some optimization problems in molecular biology
- A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
- A greedy randomised search heuristic for time-constrained vehicle scheduling and the incorporation of a learning strategy
- The Backboard Wiring Problem: A Placement Algorithm
- Assignment Problems and the Location of Economic Activities
- An annotated bibliography of GRASP-Part II: Applications
- GRASP with path relinking for the weighted MAXSAT problem
- An annotated bibliography of GRASP – Part I: Algorithms
- Tabu Search—Part I
- Tabu Search—Part II
- Tabu Search Applied to the Quadratic Assignment Problem
- Finding a Maximum Cut of a Planar Graph in Polynomial Time
- Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
- P-Complete Approximation Problems
- On the Shannon capacity of a graph
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
- A GRASP for graph planarization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Algorithm 769
- Randomized heuristics for the Max-Cut problem
- Solving Graph Bisection Problems with Semidefinite Programming
- Gadgets, Approximation, and Linear Programming
- A Spectral Bundle Method for Semidefinite Programming
- A Nonmonotone Line Search Technique for Newton’s Method
- An Exact Algorithm for the Quadratic Assignment Problem on a Tree
- Solving a bus driver scheduling problem with randomized multistart heuristics
- Reducibility among Combinatorial Problems
- Some optimal inapproximability results
- Algorithm 815
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem
- A GRASP for coloring sparse graphs
