Pages that link to "Item:Q3635128"

The following pages link to On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems (Q3635128):

Displaying 31 items.

• Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
• Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles (Q336550) (← links)
• The coastal seaspace patrol sector design and allocation problem (Q395695) (← links)
• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
• Multiperiod location-routing with decoupled time scales (Q439365) (← links)
• Natural and extended formulations for the time-dependent traveling salesman problem (Q496646) (← links)
• The Steiner tree problem with delays: a compact formulation and reduction procedures (Q496653) (← links)
• New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141) (← links)
• Strong multi-commodity flow formulations for the asymmetric traveling salesman problem (Q724060) (← links)
• Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints (Q733522) (← links)
• A conditional logic approach for strengthening mixed 0-1 linear programs (Q817194) (← links)
• A comparative analysis of several asymmetric traveling salesman problem formulations (Q955595) (← links)
• A bilevel programming approach to the travelling salesman problem. (Q1426728) (← links)
• The selective traveling salesman problem with emission allocation rules (Q1703461) (← links)
• Identification of unidentified equality constraints for integer programming problems (Q1753456) (← links)
• The traveling salesman problem with draft limits (Q1761142) (← links)
• The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints (Q1806889) (← links)
• New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q1886799) (← links)
• A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings (Q2178909) (← links)
• Generalization of machine learning for problem reduction: a case study on travelling salesman problems (Q2241908) (← links)
• The reliability importance of components and prime implicants in coherent and non-coherent systems including total-order interactions (Q2267649) (← links)
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints (Q2276891) (← links)
• Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
• A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q2494810) (← links)
• Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? (Q2514734) (← links)
• A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions (Q2688908) (← links)
• Joint vehicle assembly‐routing problems: An integrated modeling and optimization approach (Q5191146) (← links)
• The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints (Q5946820) (← links)
• Tight lower bounds for the traveling salesman problem with draft limits (Q6109566) (← links)
• Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)
• Integer programming formulations for the \(k\)-in-a-tree problem in graphs (Q6495390) (← links)