Pages that link to "Item:Q3217947"

The following pages link to A Cutting Plane Algorithm for the Linear Ordering Problem (Q3217947):

Displaying 50 items.

• Semidefinite relaxations of ordering problems (Q359627) (← links)
• On discrete optimization with ordering (Q367635) (← links)
• A minimum violations ranking method (Q400018) (← links)
• Revised GRASP with path-relinking for the linear ordering problem (Q411258) (← links)
• A benchmark library and a comparison of heuristic methods for the linear ordering problem (Q429522) (← links)
• Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis (Q477965) (← links)
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization. (Q612873) (← links)
• New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
• The linear ordering problem with clusters: a new partial ranking (Q828738) (← links)
• Applying mod-\(k\)-cuts for solving linear ordering problems (Q839896) (← links)
• Computing minimal forecast horizons: an integer programming approach (Q853795) (← links)
• The generalized assignment problem: Valid inequalities and facets (Q909579) (← links)
• A production planning problem in FMS (Q917423) (← links)
• An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
• Models for concurrent product and process design (Q1046061) (← links)
• Nonnormal deterministic equivalents and a transformation in stochastic mathematical programming (Q1094332) (← links)
• An inexact algorithm for the sequential ordering problem (Q1108187) (← links)
• A polynomial-time solution to Papadimitriou and Steiglitz's ``traps'' (Q1109689) (← links)
• Voting schemes for which it can be difficult to tell who won the election (Q1120433) (← links)
• Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
• Facets of the balanced (acyclic) induced subgraph polytope (Q1122491) (← links)
• A cutting plane algorithm for a clustering problem (Q1122492) (← links)
• Experiments in quadratic 0-1 programming (Q1123806) (← links)
• Facets and lifting procedures for the set covering polytope (Q1123808) (← links)
• A cutting plane algorithm for the windy postman problem (Q1198736) (← links)
• Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
• Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems (Q1278590) (← links)
• A cutting-plane approach to the edge-weighted maximal clique problem (Q1309944) (← links)
• A technique for speeding up the solution of the Lagrangean dual (Q1315429) (← links)
• Two-edge connected spanning subgraphs and polyhedra (Q1330901) (← links)
• A branch-and-cut algorithm for vehicle routing problems (Q1339118) (← links)
• On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
• A polyhedral approach to sequence alignment problems (Q1585327) (← links)
• Tabu search for the dynamic bipartite drawing problem (Q1652530) (← links)
• An integer programming approach to optimal basic block instruction scheduling for single-issue processors (Q1751173) (← links)
• The linear ordering problem: instances, search space analysis and algorithms (Q1774626) (← links)
• Cutting-plane proofs in polynomial space (Q1813835) (← links)
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts (Q1814791) (← links)
• Combinatorial optimization and small polytopes (Q1814809) (← links)
• A new heuristic algorithm solving the linear ordering problem (Q1816404) (← links)
• Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
• Workload balancing and loop layout in the design of a flexible manufacturing system (Q1840856) (← links)
• A combinatorial study of partial order polytopes (Q1867280) (← links)
• The reversing number of a digraph (Q1894351) (← links)
• Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914) (← links)
• Maximum planar subgraphs and nice embeddings: Practical layout tools (Q1920420) (← links)
• Could we use a million cores to solve an integer program? (Q1935943) (← links)
• Optimal solutions for the double row layout problem (Q1940444) (← links)
• Tabu search tutorial. A graph drawing application (Q1979170) (← links)
• Analysis of a generalized linear ordering problem via integer programming (Q2009010) (← links)