A branch and bound algorithm for bi-level discrete network design problem (Q264253): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11067-012-9173-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2000900837
@@ Property / OpenAlex ID: W2000900837 / rank @@
+Normal rank
@@ Property / cites work @@
+Origin-Based Algorithm for the Traffic Assignment Problem
+Normal rank
@@ Property / cites work @@
+Robust optimization model for a dynamic network design problem under demand uncertainty
+Normal rank
@@ Property / cites work @@
+Using hybrid metaheuristics for the one-way and two-way network design problem
+Normal rank
@@ Property / cites work @@
+Nonlinear integer programming
@@ Property / cites work: Nonlinear integer programming / rank @@
+Normal rank
@@ Property / cites work @@
+An outer-approximation algorithm for a class of mixed-integer nonlinear programs
+Normal rank
@@ Property / cites work @@
+Solving mixed integer nonlinear programs by outer approximation
+Normal rank
@@ Property / cites work @@
+Q4331736
@@ Property / cites work: Q4331736 / rank @@
+Normal rank
@@ Property / cites work @@
+A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
+Normal rank
@@ Property / cites work @@
+Generalized Benders decomposition
@@ Property / cites work: Generalized Benders decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
+Normal rank
@@ Property / cites work @@
+A Dantzig-Wolfe decomposition based heuristic scheme for bi-level dynamic network design problem
+Normal rank
@@ Property / cites work @@
+Hybrid evolutionary metaheuristics for concurrent multi-objective design of urban road and public transit networks
+Normal rank
@@ Property / cites work @@
+Hybrid meta-heuristic algorithms for solving network design problem
+Normal rank
@@ Property / cites work @@
+Bilevel programming model and solution method for mixed transportation network design problem
+Normal rank