Separating tight metric inequalities by bilevel programming (Q1939716): Difference between revisions

@@ Property / describes a project that uses @@
+SNDlib
@@ Property / describes a project that uses: SNDlib / 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.orl.2012.09.009
+Normal rank
@@ Property / OpenAlex ID @@
+W1987357293
@@ Property / OpenAlex ID: W1987357293 / rank @@
+Normal rank
@@ Property / cites work @@
+k-Partition-based facets of the network design problem
+Normal rank
@@ Property / cites work @@
+On capacitated network design cut-set polyhedra
@@ Property / cites work: On capacitated network design cut-set polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Metric inequalities and the network loading problem
+Normal rank
@@ Property / cites work @@
+Network Design Using Cut Inequalities
@@ Property / cites work: Network Design Using Cut Inequalities / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum cost capacity installation for multicommodity network flows
+Normal rank
@@ Property / cites work @@
+Bilevel programming: a survey
@@ Property / cites work: Bilevel programming: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
+Normal rank
@@ Property / cites work @@
+An improved Benders decomposition applied to a multi-layer network design problem
+Normal rank
@@ Property / cites work @@
+Diversification strategies in local search for a nonbifurcated network loading problem
+Normal rank
@@ Property / cites work @@
+A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for capacitated network design problems
+Normal rank
@@ Property / cites work @@
+A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
+Normal rank
@@ Property / cites work @@
+Q5629416
@@ Property / cites work: Q5629416 / rank @@
+Normal rank
@@ Property / cites work @@
+The convex hull of two core capacitated network design problems
+Normal rank
@@ Property / cites work @@
+Modeling and Solving the Two-Facility Capacitated Network Loading Problem
+Normal rank
@@ Property / cites work @@
+Solving survivable two-layer network design problems by metric inequalities
+Normal rank
@@ Property / cites work @@
+On cut-based inequalities for capacitated network design polyhedra
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1939716