Exact and heuristic algorithms for the interval data robust assignment problem (Q632649): Difference between revisions

@@ Property / DOI @@
-.1016/j.cor.2010.11.009
@@ Property / DOI: 10.1016/j.cor.2010.11.009 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+Scatter Search
@@ Property / describes a project that uses: Scatter Search / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+OR-Library
@@ Property / describes a project that uses: OR-Library / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Tabu search
@@ Property / describes a project that uses: Tabu search / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+CPLEX
@@ Property / describes a project that uses: CPLEX / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2010.11.009
+Normal rank
@@ Property / OpenAlex ID @@
+W1968866800
@@ Property / OpenAlex ID: W1968866800 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of the min-max and min-max regret assignment problems
+Normal rank
@@ Property / cites work @@
+Min-max and min-max regret versions of combinatorial optimization problems: A survey
+Normal rank
@@ Property / cites work @@
+Complexity of the min-max (regret) versions of min cut problems
+Normal rank
@@ Property / cites work @@
+On the complexity of a class of combinatorial optimization problems with uncertainty
+Normal rank
@@ Property / cites work @@
+Interval data minmax regret network optimization problems
+Normal rank
@@ Property / cites work @@
+Linear Programming on Cray Supercomputers
@@ Property / cites work: Linear Programming on Cray Supercomputers / rank @@
+Normal rank
@@ Property / cites work @@
+A genetic algorithm for the set covering problem
@@ Property / cites work: A genetic algorithm for the set covering problem / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning procedures for solving mixed-variables programming problems
+Normal rank
@@ Property / cites work @@
+Q5465123
@@ Property / cites work: Q5465123 / rank @@
+Normal rank
@@ Property / cites work @@
+Assignment Problems
@@ Property / cites work: Assignment Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized Benders decomposition
@@ Property / cites work: Generalized Benders decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+Q4354785
@@ Property / cites work: Q4354785 / rank @@
+Normal rank
@@ Property / cites work @@
+Ejection chain and filter-and-fan methods in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Q4692508
@@ Property / cites work: Q4692508 / rank @@
+Normal rank
@@ Property / cites work @@
+A shortest augmenting path algorithm for dense and sparse linear assignment problems
+Normal rank
@@ Property / cites work @@
+Discrete optimization with interval data. Minmax regret and fuzzy approach
+Normal rank
@@ Property / cites work @@
+Scatter search. Methodology and implementation in C. With CD-ROM.
+Normal rank
@@ Property / cites work @@
+A Benders decomposition approach for the robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+The robust shortest path problem with interval data via Benders decomposition
+Normal rank
@@ Property / cites work @@
+The robust set covering problem with interval data
+Normal rank
@@ Property / cites work @@
+Q4461910
@@ Property / cites work: Q4461910 / rank @@
+Normal rank
@@ Property / cites work @@
+On the History of Combinatorial Optimization (Till 1960)
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2010.11.009
@@ Property / DOI: 10.1016/J.COR.2010.11.009 / rank @@
+Normal rank