Category:LNCS 1084

From BibNetWiki

Lecture Notes in Computer Science, Volume 1084

Articles in category "LNCS 1084"

There are 37 articles in this category.

A A Heuristic Algorithm for the Set Covering Problem A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem A Polyhedral Approach to the Feedback Vertex Set Problem A Semidefinite Bound for Mixing Rates of Markov Chains A Submodular Optimization Problem with Side Constraints A Supermodular Relaxation for Scheduling with Release Dates Algorithms and Extended Formulations for One and Two Facility Network Design An ??-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems An Optimal, Stable Continued Fraction Algorithm for Arbitrary Dimension Approximating k-Set Cover and Complementary Graph Coloring C Coloring Bipartite Hypergraphs

C cont. Colourful Linear Programming Cone-LP's and Semidefinite Programs: Geometry and a Simplex-Type Method Continuous Relaxations for Constrained Maximum-Entropy Sampling Convexity and Steinitz's Exchange Property F Finding Real-Valued Single-Source Shortest Paths in o(n03) Expected Time I Implementation of a Linear Time Algorithm for Certain Generalized Traveling Salesman Problems Improved Randomized Approximation Algorithms for Lot-Sizing Problems Integer Multicommodity Flow Problems Integer programming and combinatorial optimization: 5th International IPCO Conference, Vancouver, British of Columnia, Canada, June 3-5, 1996: proceedings M Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases O On Dependent Randomized Rounding Algorithms On Ideal Clutters, Metrics and Multiflows On Minimum 3-Cuts and Approximating k-Cuts Using Cut Trees

O cont. On Optimizing Multiplications of Sparse Matrices Optimal On-Line Algorithms for Single-Machine Scheduling P Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs Q Quadratic Knapsack Relaxations Using Cutting Planes and Semidefinite Programming S Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds Separating Maximally Violated Comb Inequalities in Planar Graphs Separating over Classes of TSP Inequalities Defined by 0 Node-Lifting in Polynomial Time T Test Sets and Inequalities for Integer Programs The Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard Cases The Strongest Facets of the Acyclic Subgraph Polytope Are Unknown The Travelling Salesman and the PQ-Tree Transitive Packing