scientific article
From MaRDI portal
Publication:3680289
zbMath0565.68058MaRDI QIDQ3680289
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear programmingschedulingbranch and boundconvex hullcutting planefacetseconomicssocial sciencespolyhedral approachfeedback arc set problemacyclic subgraph problemcomplete directed grapharcheologyspanning acyclic tournament of maximum total arc weight
Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Discrete mathematics in relation to computer science (68Rxx)
Related Items
The median procedure in the semilattice of orders, The linear ordering problem with clusters: a new partial ranking, Applying mod-\(k\)-cuts for solving linear ordering problems, \((0,{1\over 2},1)\) matrices which are extreme points of the generalized transitive tournament polytope, On the integral dicycle packings and covers and the linear ordering polytope, Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey, A survey on the linear ordering problem for weighted or unweighted tournaments, On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope, Fairness and the set of optimal rankings for the linear ordering problem, On the partial order polytope of a digraph, Solving real-world linear ordering problems using a primal-dual interior point cutting plane method, On discrete optimization with ordering, A cutting plane algorithm for a clustering problem, A minimum violations ranking method, Unnamed Item, SOLO: A Linear Ordering Approach to Path Analysis of Web Site Traffic, Revised GRASP with path-relinking for the linear ordering problem, A branch-and-bound algorithm for the linear ordering problem with cumulative costs, A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems, A benchmark library and a comparison of heuristic methods for the linear ordering problem, A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments, Facets of linear signed order polytopes., Extremal values of global tolerances in combinatorial optimization with an additive objective function, On VLSI interconnect optimization and linear ordering problem, Generalizing the concept of binary choice systems induced by rankings: One way of probabilizing deterministic measurement structures, Induced binary probabilities and the linear ordering polytope: A status report, Geometric and combinatorial properties of the polytope of binary choice probabilities, A branch-and-cut algorithm for a resource-constrained scheduling problem, Voting Procedures, Complexity of, On the feedback vertex set problem for a planar graph, The strongest facets of the acyclic subgraph polytope are unknown, Generalized transitive tournaments and doubly stochastic matrices, Rank aggregation in cyclic sequences, Exact solution procedures for the balanced unidirectional cyclic layout problem, The linear ordering problem with cumulative costs, An updated survey on the linear ordering problem for weighted or unweighted tournaments, The biorder polytope, Variable neighborhood search for the linear ordering problem, Determining the automorphism group of the linear ordering polytope, NP-hardness results for the aggregation of linear orders into median orders, How to recycle your facets, Primary facets of order polytopes, Computational Approaches to Max-Cut, Global Approaches for Facility Layout and VLSI Floorplanning, A branch and bound algorithm for the minimum storage-time sequencing problem, Parameterized algorithmics for linear arrangement problems, A branch-and-cut algorithm for the target visitation problem, Combinatorial optimization and small polytopes, The rankability of weighted data from pairwise comparisons, A semidefinite optimization approach for the single-row layout problem with unequal dimensions, A cutting-plane approach to the edge-weighted maximal clique problem, Signed orders, choice probabilities, and linear polytopes, Branch distance optimization of structured programs, The Rankability of Data, On the combinatorial structure of the approval-voting polytope, Independent random utility representations
Uses Software
