scientific article; zbMATH DE number 3793772
From MaRDI portal
Publication:4739657
Cited in
(only showing first 100 items - show all)- An assignment-based heuristic for vehicle routing with time windows
- Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions
- The subdivision-constrained minimum spanning tree problem
- Dealing with label switching in mixture models under genuine multimodality
- A complexity tradeoff in ranking-function termination proofs
- Parallel ILP for distributed-memory architectures
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- GRAFT, a complete system for data fusion
- A survey on metaheuristics for stochastic combinatorial optimization
- Greedily constructing maximal partial f-factors
- On the design of correct and optimal dynamical systems and games
- On visualization scaling, subeigenvectors and Kleene stars in max algebra
- Subclasses of solvable problems from classes of combinatorial optimization problems
- Using a greedy random adaptative search procedure to solve the cover printing problem
- A primal-dual simplex algorithm for bi-objective network flow problems
- Hybridizing exact methods and metaheuristics: a taxonomy
- Interactive construction of graphical decision models based on causal mechanisms
- Asymptotics of the minimum manipulating coalition size for positional voting rules under impartial culture behaviour
- A memetic algorithm for graph coloring
- The complexity of determining a shortest cycle of even length
- The complexity of facets (and some facets of complexity)
- A successful algorithm for the undirected Hamiltonian path problem
- An approach to the subgraph homeomorphism problem
- An analysis of a decomposition heuristic for the assignment problem
- A matching problem in the plane
- Concerning the achromatic number of graphs
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- Games against nature
- On negative cycles in mixed graphs
- A lower bound to the complexity of Euclidean and rectilinear matching algorithms
- The complexity of analog computation
- Randomized algorithms in combinatorial optimization: A survey
- Scaling algorithms for network problems
- Polyhedral proof methods in combinatorial optimization
- A condition for the strong regularity of matrices in the minimax algebra
- An algorithm for shortest-path motion in three dimensions
- The hierarchical network design problem
- Complexity of certain decision problems about congruential languages
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- A Lagrangean relaxation method for the constrained assignment problem
- Representability in mixed integer programming. I: Characterization results
- Strong linear independence in bottleneck algebra
- Karmarkar's algorithm and the ellipsoid method
- Structural analysis of local search heuristics in combinatorial optimization
- Scheduling jobs with fixed start and end times
- Fractional matchings and the Edmonds-Gallai theorem
- Complexity of matching problems
- Communication complexity of convex optimization
- Minimum cost-reliability ratio path problem
- Minimum deviation problems
- Probabilistic satisfiability
- On finding optimal and near-optimal lineal spanning trees
- The general maximum matching algorithm of Micali and Vazirani
- Computing the bump number is easy
- Communication and its cost in graph-restricted games
- The complexity of facets resolved
- How easy is local search?
- The complexity of recognizing polyhedral scenes
- A new dominance procedure for combinatorial optimization problems
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps
- Algorithms of placing recovery points
- On the efficiency of maximum-flow algorithms on networks with small integer capacities
- Decentralized detection by a large number of sensors
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Construction of infinite de Bruijn arrays
- Optimal product design using conjoint analysis: Computational complexity and algorithms
- Dual coordinate step methods for linear network flow problems
- A new approach to choosing initial points in local search
- An algorithm for the detection and construction of Monge sequences
- Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs
- The parallel complexity of finding a blocking flow in a 3-layer network
- On the number of steps in proofs
- Scheduling unit-time jobs on processors with different capabilities
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- Local optimization on graphs
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Single-machine scheduling with learning considerations
- On finding a vertex solution using interior point methods
- On the complexity of generalized due date scheduling problems
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem
- Correlation polytopes: Their geometry and complexity
- The uniquely solvable bipartite matching problem
- Systematic choice of initial points in local search: Extensions and application to neural networks
- Temporal constraint networks
- An unfeasible matching problem
- An -approximation scheme for combinatorial optimization problems with minimum variance criterion
- A fully polynomial time approximation scheme for minimum cost-reliability ratio problems
- A note on the approximation of the MAX CLIQUE problem
- Finding minimum-cost flows by double scaling
- Optimal placement of identical resources in a tree
- Weighted graphs and university course timetabling
- A weighted min-max relation for intervals
- Local minima for indefinite quadratic knapsack problems
- Optimal strategies for some team games
- Finding approximate solutions to NP-hard problems by neural networks is hard
- An arithmetic model of computation equivalent to threshold circuits
- Scheduling to minimize weighted earliness and tardiness about a common due-date
- Learning in parallel
- On players with a bounded number of states
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4739657)
