Pages that link to "Item:Q1025989"

The following pages link to 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989):

Displaying 34 items.

• Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245) (← links)
• Unsplittable non-additive capacitated network design using set functions polyhedra (Q342169) (← links)
• A stabilized structured Dantzig-Wolfe decomposition method (Q359629) (← links)
• Column generation for extended formulations (Q458128) (← links)
• Accelerated multigrid for graph Laplacian operators (Q670780) (← links)
• Prize collecting Steiner trees with node degree dependent costs (Q709134) (← links)
• Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
• Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows (Q1694312) (← links)
• Liner shipping service scheduling and cargo allocation (Q1719622) (← links)
• Efficient metaheuristics to solve the intermodal terminal location problem (Q1761128) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• A note on ``A LP-based heuristic for a time-constrained routing problem'' (Q1926858) (← links)
• Enhancing discretized formulations: the knapsack reformulation and the star reformulation (Q1935879) (← links)
• On the approximability of robust network design (Q1998836) (← links)
• A new extended formulation of the generalized assignment problem and some associated valid inequalities (Q2009013) (← links)
• Integrated model for timetabling and circulation planning on an urban rail transit line: a coupled network-based flow formulation (Q2129563) (← links)
• A MIP-based approach to solve the prize-collecting local access network design problem (Q2256343) (← links)
• A fuzzy programming method for modeling demand uncertainty in the capacitated road-rail multimodal routing problem with time windows (Q2334965) (← links)
• Primal convergence from dual subgradient methods for convex optimization (Q2340335) (← links)
• The minimum flow cost Hamiltonian cycle problem: a comparison of formulations (Q2348064) (← links)
• Revisiting Lagrangian relaxation for network design (Q2414466) (← links)
• Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows (Q2434985) (← links)
• Discretized formulations for capacitated location problems with modular distribution costs (Q2655611) (← links)
• Column Generation for Extended Formulations (Q2840735) (← links)
• (Q2861520) (← links)
• Exact approaches to the single-source network loading problem (Q2892148) (← links)
• Modeling and solving a multimodal transportation problem with flexible-time and scheduled services (Q3076017) (← links)
• Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (Q4648687) (← links)
• Multilevel Approaches for the Critical Node Problem (Q4994170) (← links)
• Single Allocation Hub Location with Heterogeneous Economies of Scale (Q5080641) (← links)
• On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics (Q5214308) (← links)
• Affine recourse for the robust network design problem: Between static and dynamic routing (Q5326787) (← links)
• Comments on: ``Static and dynamic source locations in undirected networks'' (Q5966289) (← links)
• Affine routing for robust network design (Q6065910) (← links)