Search results
From MaRDI portal
- pollution-routing problem 2015-02-18 Paper Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? 2015-02-03 Paper An adaptive large neighborhood search...10 bytes (17 words) - 14:50, 10 December 2023
- Paper https://portal.mardi4nfdi.de/entity/Q5111751 2020-05-27 Paper Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP...10 bytes (19 words) - 10:10, 11 December 2023
- Paper An optimality cut for mixed integer linear programs 1999-11-25 Paper A generalized linear programming model for nurse scheduling 1999-07-11 Paper...10 bytes (16 words) - 19:46, 9 December 2023
- formulations 2015-03-12 Paper Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? 2015-02-03 Paper An improved decomposition-based heuristic...10 bytes (16 words) - 23:53, 8 December 2023
- unknown gradient 2022-01-25 Paper Adaptive Relaxation Strategy on Basic Iterative Methods for Solving Linear Systems with Single and Multiple Right-Hand...10 bytes (17 words) - 22:59, 10 December 2023
- https://portal.mardi4nfdi.de/entity/Q4217583 1999-06-08 Paper A new subtour elimination constraint for the vehicle routing problem 1999-02-22 Paper https://portal...10 bytes (17 words) - 17:04, 8 December 2023
- Keywords traveling salesman problem; extreme solutions; subtour elimination linear program relaxation Mathematics Subject Classification ID 90C27: Combinatorial...15 bytes (64 words) - 04:07, 30 January 2024
- note on the effects of linear approximation on hypothesis testing 2013-10-24 Paper A linear algebraic procedure for solving linear perfect foresight models...10 bytes (16 words) - 12:14, 7 October 2023
- vehicle routing; relaxation; subtour elimination constraints; split delivery; connectivity constraints; fractional cycle elimination constraints Mathematics...15 bytes (84 words) - 13:29, 31 January 2024
- zbMATH Keywords local search; heuristic; linear programming relaxation; polynomial time; traps; subtour elimination constraints; symmetric travelling salesman...15 bytes (83 words) - 03:10, 31 January 2024
- sequence of linear relaxations; subtour elimination inequalities Mathematics Subject Classification ID 65K05: Numerical mathematical programming methods 52B12:...15 bytes (99 words) - 18:14, 30 January 2024
- 1050 zbMATH Keywords vehicle routing; integer linear programming; subtour elimination; constraint relaxation; capacity and distance constraints Mathematics...15 bytes (110 words) - 09:29, 5 February 2024
- algorithm; traveling salesman; relaxation method; polynomial algorithm; polyhedral theory; cutting plane algorithm; subtour elimination; computational aspects;...15 bytes (98 words) - 10:40, 5 February 2024
- org/doc/104926 zbMATH Keywords duality; layering; mixed-integer programming; facets; subtour elimination constraints; variable splitting; implicit constraints;...15 bytes (100 words) - 13:51, 5 February 2024
- computational study; linear integer programming; large-scale test problems; cutting-plane approach; comb constraints; subtour- elimination; symmetric travelling...15 bytes (140 words) - 20:28, 5 February 2024
