Algorithms and Complexity [[electronic resource] ] : 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings / / edited by Dimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos |
Edizione | [1st ed. 2017.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
Descrizione fisica | 1 online resource (XX, 486 p. 59 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Discrete Mathematics in Computer Science Data Science |
ISBN | 3-319-57586-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996465810703316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithms and Complexity [[electronic resource] ] : 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings / / edited by Dimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos |
Edizione | [1st ed. 2017.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
Descrizione fisica | 1 online resource (XX, 486 p. 59 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Discrete Mathematics in Computer Science Data Science |
ISBN | 3-319-57586-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910484131903321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Algorithms and Complexity [[electronic resource] ] : 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings / / edited by Vangelis Th. Paschos, Peter Widmayer |
Edizione | [1st ed. 2015.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
Descrizione fisica | 1 online resource (XV, 430 p. 81 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Discrete Mathematics in Computer Science Data Science |
ISBN | 3-319-18173-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Communication, Dynamics and Renormalization -- Fast and Powerful Hashing using Tabulation -- Green Barrier Coverage with Mobile Sensors -- A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths -- Orthogonal Graph Drawing with Inflexible Edges -- Linear time Constructions of some d-Restriction Problems -- Efficiently Testing T-Interval Connectivity in Dynamic Graphs -- Competitive Strategies for Online Clique Clustering -- Scheduling with Gaps: New Models and Algorithms -- MinMax-Distance Gathering on given Meeting Points -- Evacuating Robots from a Disk Using Face-to-Face Communication -- Planarity of Streamed Graphs -- Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs -- Randomized Adaptive Test Cover -- Contraction Blockers for Graphs with Forbidden Induced Paths -- Label Placement in Road Maps -- Discrete Stochastic Submodular Maximization: Adaptive vs. Non-Adaptive vs. Offline -- Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints -- Simple strategies versus optimal schedules in multi-agent patrolling -- Sharing Non-Anonymous Costs of Multiple Resources Optimally -- Algorithms solving the Matching Cut problem -- End-Vertices of Graph Search Algorithms -- Deciding the On-line Chromatic Number of a Graph with Pre-coloring is PSPACE-complete -- A Lex-BFS-based recognition algorithm for Robinsonian matrices -- Mixed Map Labeling -- Optimal Online Edge Coloring of Planar Graphs with Advice -- Approximability of Two Variants of Multiple Knapsack -- Block Sorting is Hard -- An opportunistic text indexing structure based on run length encoding -- PSPACE-completeness of Bloxorz and of Games with 2-Buttons -- Advice Complexity of Fine-Grained Job Shop Scheduling. |
Record Nr. | UNISA-996200028403316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithms and Complexity [[electronic resource] ] : 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings / / edited by Vangelis Th. Paschos, Peter Widmayer |
Edizione | [1st ed. 2015.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
Descrizione fisica | 1 online resource (XV, 430 p. 81 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Discrete Mathematics in Computer Science Data Science |
ISBN | 3-319-18173-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Communication, Dynamics and Renormalization -- Fast and Powerful Hashing using Tabulation -- Green Barrier Coverage with Mobile Sensors -- A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths -- Orthogonal Graph Drawing with Inflexible Edges -- Linear time Constructions of some d-Restriction Problems -- Efficiently Testing T-Interval Connectivity in Dynamic Graphs -- Competitive Strategies for Online Clique Clustering -- Scheduling with Gaps: New Models and Algorithms -- MinMax-Distance Gathering on given Meeting Points -- Evacuating Robots from a Disk Using Face-to-Face Communication -- Planarity of Streamed Graphs -- Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs -- Randomized Adaptive Test Cover -- Contraction Blockers for Graphs with Forbidden Induced Paths -- Label Placement in Road Maps -- Discrete Stochastic Submodular Maximization: Adaptive vs. Non-Adaptive vs. Offline -- Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints -- Simple strategies versus optimal schedules in multi-agent patrolling -- Sharing Non-Anonymous Costs of Multiple Resources Optimally -- Algorithms solving the Matching Cut problem -- End-Vertices of Graph Search Algorithms -- Deciding the On-line Chromatic Number of a Graph with Pre-coloring is PSPACE-complete -- A Lex-BFS-based recognition algorithm for Robinsonian matrices -- Mixed Map Labeling -- Optimal Online Edge Coloring of Planar Graphs with Advice -- Approximability of Two Variants of Multiple Knapsack -- Block Sorting is Hard -- An opportunistic text indexing structure based on run length encoding -- PSPACE-completeness of Bloxorz and of Games with 2-Buttons -- Advice Complexity of Fine-Grained Job Shop Scheduling. |
Record Nr. | UNINA-9910483445903321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Applications of combinatorial optimization / / edited by Vangelis Th. Paschos |
Edizione | [Revised and updated second edition.] |
Pubbl/distr/stampa | London, [England] ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2014 |
Descrizione fisica | 1 online resource (449 p.) |
Disciplina | 519.64 |
Collana | Mathematics and Statistics Series |
Soggetto topico | Combinatorial optimization |
ISBN |
1-119-00538-8
1-119-01522-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Cover; Title Page; Copyright; Contents; Preface; Chapter 1: Airline Crew Pairing Optimization; 1.1. Introduction; 1.2. Definition of the problem; 1.2.1. Constructing subnetworks; 1.2.2. Pairing costs; 1.2.3. Model; 1.2.4. Case without resource constraints; 1.3. Solution approaches; 1.3.1. Decomposition principles; 1.3.2. Column generation, master problem and subproblem; 1.3.3. Branching methods for finding integer solutions; 1.4. Solving the subproblem for column generation; 1.4.1. Mathematical formulation; 1.4.2. General principle of effective label generation
1.4.3. Case of one single resource: the bucket method1.4.4. Case of many resources: reduction of the resource space; 1.4.4.1. Reduction principle; 1.4.4.2. Approach based on the Lagrangian relaxation; 1.4.4.3. Approach based on the surrogate relaxation; 1.5. Conclusion; 1.6. Bibliography; Chapter 2: The Task Allocation Problem; 2.1. Presentation; 2.2. Definitions and modeling; 2.2.1. Definitions; 2.2.2. The processors; 2.2.3. Communications; 2.2.4. Tasks; 2.2.5. Allocation types; 2.2.5.1. Static allocation; 2.2.5.2. Dynamic allocation; 2.2.5.3. With or without pre-emption 2.2.5.4. Task duplication2.2.6. Allocation/scheduling; 2.2.7. Modeling; 2.2.7.1. Modeling costs; 2.2.7.2. Constraints; 2.2.7.3. Objectives of the allocation; 2.2.7.3.1. Minimizing the execution duration; 2.2.7.3.2. Minimizing the global execution and communication cost; 2.2.7.3.3. Load balancing; 2.3. Review of the main works; 2.3.1. Polynomial cases; 2.3.1.1. Two-processor cases; 2.3.1.2. Tree case; 2.3.1.3. Other structures; 2.3.1.4. Restrictions on the processors or the tasks; 2.3.1.5. Minmax objective; 2.3.2. Approximability; 2.3.3. Approximate solution; 2.3.3.1. Heterogenous processors 2.3.3.2. Homogenous processors2.3.4. Exact solution; 2.3.5. Independent tasks case; 2.4. A little-studied model; 2.4.1. Model; 2.4.2. A heuristic based on graphs; 2.4.2.1. Transformation of the problem; 2.4.2.2. Modeling; 2.4.2.3. Description of the heuristic; 2.5. Conclusion; 2.6. Bibliography; Chapter 3: A Comparison of Some Valid Inequality Generation Methods for General 0-1 Problems; 3.1. Introduction; 3.2. Presentation of the various techniques tested; 3.2.1. Exact separation with respect to a mixed relaxation; 3.2.2. Approximate separation using a heuristic 3.2.3. Restriction + separation + relaxed lifting (RSRL)3.2.4. Disjunctive programming and the lift and project procedure; 3.2.5. Reformulation-linearization technique (RLT); 3.3. Computational results; 3.3.1. Presentation of test problems; 3.3.2. Presentation of the results; 3.3.3. Discussion of the computational results; 3.4. Bibliography; Chapter 4: Production Planning; 4.1. Introduction; 4.2. Hierarchical planning; 4.3. Strategic planning and productive system design; 4.3.1. Group technology; 4.3.2. Locating equipment; 4.4. Tactical planning and inventory management 4.4.1. A linear programming model for medium-term planning |
Record Nr. | UNINA-9910132155703321 |
London, [England] ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2014 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Applications of combinatorial optimization / / edited by Vangelis Th. Paschos |
Edizione | [Revised and updated second edition.] |
Pubbl/distr/stampa | London, [England] ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2014 |
Descrizione fisica | 1 online resource (449 p.) |
Disciplina | 519.64 |
Collana | Mathematics and Statistics Series |
Soggetto topico | Combinatorial optimization |
ISBN |
1-119-00538-8
1-119-01522-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Cover; Title Page; Copyright; Contents; Preface; Chapter 1: Airline Crew Pairing Optimization; 1.1. Introduction; 1.2. Definition of the problem; 1.2.1. Constructing subnetworks; 1.2.2. Pairing costs; 1.2.3. Model; 1.2.4. Case without resource constraints; 1.3. Solution approaches; 1.3.1. Decomposition principles; 1.3.2. Column generation, master problem and subproblem; 1.3.3. Branching methods for finding integer solutions; 1.4. Solving the subproblem for column generation; 1.4.1. Mathematical formulation; 1.4.2. General principle of effective label generation
1.4.3. Case of one single resource: the bucket method1.4.4. Case of many resources: reduction of the resource space; 1.4.4.1. Reduction principle; 1.4.4.2. Approach based on the Lagrangian relaxation; 1.4.4.3. Approach based on the surrogate relaxation; 1.5. Conclusion; 1.6. Bibliography; Chapter 2: The Task Allocation Problem; 2.1. Presentation; 2.2. Definitions and modeling; 2.2.1. Definitions; 2.2.2. The processors; 2.2.3. Communications; 2.2.4. Tasks; 2.2.5. Allocation types; 2.2.5.1. Static allocation; 2.2.5.2. Dynamic allocation; 2.2.5.3. With or without pre-emption 2.2.5.4. Task duplication2.2.6. Allocation/scheduling; 2.2.7. Modeling; 2.2.7.1. Modeling costs; 2.2.7.2. Constraints; 2.2.7.3. Objectives of the allocation; 2.2.7.3.1. Minimizing the execution duration; 2.2.7.3.2. Minimizing the global execution and communication cost; 2.2.7.3.3. Load balancing; 2.3. Review of the main works; 2.3.1. Polynomial cases; 2.3.1.1. Two-processor cases; 2.3.1.2. Tree case; 2.3.1.3. Other structures; 2.3.1.4. Restrictions on the processors or the tasks; 2.3.1.5. Minmax objective; 2.3.2. Approximability; 2.3.3. Approximate solution; 2.3.3.1. Heterogenous processors 2.3.3.2. Homogenous processors2.3.4. Exact solution; 2.3.5. Independent tasks case; 2.4. A little-studied model; 2.4.1. Model; 2.4.2. A heuristic based on graphs; 2.4.2.1. Transformation of the problem; 2.4.2.2. Modeling; 2.4.2.3. Description of the heuristic; 2.5. Conclusion; 2.6. Bibliography; Chapter 3: A Comparison of Some Valid Inequality Generation Methods for General 0-1 Problems; 3.1. Introduction; 3.2. Presentation of the various techniques tested; 3.2.1. Exact separation with respect to a mixed relaxation; 3.2.2. Approximate separation using a heuristic 3.2.3. Restriction + separation + relaxed lifting (RSRL)3.2.4. Disjunctive programming and the lift and project procedure; 3.2.5. Reformulation-linearization technique (RLT); 3.3. Computational results; 3.3.1. Presentation of test problems; 3.3.2. Presentation of the results; 3.3.3. Discussion of the computational results; 3.4. Bibliography; Chapter 4: Production Planning; 4.1. Introduction; 4.2. Hierarchical planning; 4.3. Strategic planning and productive system design; 4.3.1. Group technology; 4.3.2. Locating equipment; 4.4. Tactical planning and inventory management 4.4.1. A linear programming model for medium-term planning |
Record Nr. | UNINA-9910808645303321 |
London, [England] ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2014 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Applications of combinatorial optimization [[electronic resource] /] / edited by Vangelis Th. Paschos |
Pubbl/distr/stampa | London, : ISTE |
Descrizione fisica | 1 online resource (409 p.) |
Disciplina | 519.64 |
Altri autori (Persone) | PaschosVangelis Th |
Collana | Combinatorial optimization |
Soggetto topico | Combinatorial optimization |
ISBN |
1-118-60028-2
1-118-60034-7 1-118-60011-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Cover; Applications of Combinatorial Optimization; Title Page; Copyright Page; Table of Contents; Preface; Chapter 1. Airline Crew Pairing Optimization; 1.1. Introduction; 1.2. Definition of the problem; 1.2.1. Constructing subnetworks; 1.2.2. Pairing costs; 1.2.3. Model; 1.2.4. Case without resource constraints; 1.3. Solution approaches; 1.3.1. Decomposition principles; 1.3.2. Column generation, master problem and subproblem; 1.3.3. Branching methods for finding integer solutions; 1.4. Solving the subproblem for column generation; 1.4.1. Mathematical formulation
1.4.2. General principle of effective label generation1.4.3. Case of one single resource: the bucket method; 1.4.4. Case of many resources: reduction of the resource space; 1.5. Conclusion; 1.6. Bibliography; Chapter 2. The Task Allocation Problem; 2.1. Presentation; 2.2. Definitions and modeling; 2.2.1. Definitions; 2.2.2. The processors; 2.2.3. Communications; 2.2.4. Tasks; 2.2.5. Allocation types; 2.2.6. Allocation/scheduling; 2.2.7. Modeling; 2.3. Review of the main works; 2.3.1. Polynomial cases; 2.3.2. Approximability; 2.3.3. Approximate solution; 2.3.4. Exact solution 2.3.5. Independent tasks case2.4. A little-studied model; 2.4.1. Model; 2.4.2. A heuristic based on graphs; 2.5. Conclusion; 2.6. Bibliography; Chapter 3. A Comparison of Some Valid Inequality Generation Methods for General 0-1 Problems; 3.1. Introduction; 3.2. Presentation of the various techniques tested; 3.2.1. Exact separation with respect to a mixed relaxation; 3.2.2. Approximate separation using a heuristic; 3.2.3. Restriction + separation + relaxed lifting (RSRL); 3.2.4. Disjunctive programming and the lift and project procedure; 3.2.5. Reformulation-linearization technique (RLT) 3.3. Computational results3.3.1. Presentation of test problems; 3.3.2. Presentation of the results; 3.3.3. Discussion of the computational results; 3.4. Bibliography; Chapter 4. Production Planning; 4.1. Introduction; 4.2. Hierarchical planning; 4.3. Strategic planning and productive system design; 4.3.1. Group technology; 4.3.2. Locating equipment; 4.4. Tactical planning and inventory management; 4.4.1. A linear programming model for medium-term planning; 4.4.2. Inventory management; 4.4.3. Wagner and Whitin model; 4.4.4. The economic order quantity model (EOQ) 4.4.5. The EOQ model with joint replenishments4.5. Operations planning and scheduling; 4.5.1. Tooling; 4.5.2. Robotic cells; 4.6. Conclusion and perspectives; 4.7. Bibliography; Chapter 5. Operations Research and Goods Transportation; 5.1. Introduction; 5.2. Goods transport systems; 5.3. Systems design; 5.3.1. Location with balancing requirements; 5.3.2. Multiproduct production-distribution; 5.3.3. Hub location; 5.4. Long-distance transport; 5.4.1. Service network design; 5.4.2. Static formulations; 5.4.3. Dynamic formulations; 5.4.4. Fleet management; 5.5. Vehicle routing problems 5.5.1. Definitions and complexity |
Record Nr. | UNINA-9910141601303321 |
London, : ISTE | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Applications of combinatorial optimization [[electronic resource] /] / edited by Vangelis Th. Paschos |
Edizione | [1st ed.] |
Pubbl/distr/stampa | London, : ISTE |
Descrizione fisica | 1 online resource (409 p.) |
Disciplina | 519.64 |
Altri autori (Persone) | PaschosVangelis Th |
Collana | Combinatorial optimization |
Soggetto topico | Combinatorial optimization |
ISBN |
1-118-60028-2
1-118-60034-7 1-118-60011-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Cover; Applications of Combinatorial Optimization; Title Page; Copyright Page; Table of Contents; Preface; Chapter 1. Airline Crew Pairing Optimization; 1.1. Introduction; 1.2. Definition of the problem; 1.2.1. Constructing subnetworks; 1.2.2. Pairing costs; 1.2.3. Model; 1.2.4. Case without resource constraints; 1.3. Solution approaches; 1.3.1. Decomposition principles; 1.3.2. Column generation, master problem and subproblem; 1.3.3. Branching methods for finding integer solutions; 1.4. Solving the subproblem for column generation; 1.4.1. Mathematical formulation
1.4.2. General principle of effective label generation1.4.3. Case of one single resource: the bucket method; 1.4.4. Case of many resources: reduction of the resource space; 1.5. Conclusion; 1.6. Bibliography; Chapter 2. The Task Allocation Problem; 2.1. Presentation; 2.2. Definitions and modeling; 2.2.1. Definitions; 2.2.2. The processors; 2.2.3. Communications; 2.2.4. Tasks; 2.2.5. Allocation types; 2.2.6. Allocation/scheduling; 2.2.7. Modeling; 2.3. Review of the main works; 2.3.1. Polynomial cases; 2.3.2. Approximability; 2.3.3. Approximate solution; 2.3.4. Exact solution 2.3.5. Independent tasks case2.4. A little-studied model; 2.4.1. Model; 2.4.2. A heuristic based on graphs; 2.5. Conclusion; 2.6. Bibliography; Chapter 3. A Comparison of Some Valid Inequality Generation Methods for General 0-1 Problems; 3.1. Introduction; 3.2. Presentation of the various techniques tested; 3.2.1. Exact separation with respect to a mixed relaxation; 3.2.2. Approximate separation using a heuristic; 3.2.3. Restriction + separation + relaxed lifting (RSRL); 3.2.4. Disjunctive programming and the lift and project procedure; 3.2.5. Reformulation-linearization technique (RLT) 3.3. Computational results3.3.1. Presentation of test problems; 3.3.2. Presentation of the results; 3.3.3. Discussion of the computational results; 3.4. Bibliography; Chapter 4. Production Planning; 4.1. Introduction; 4.2. Hierarchical planning; 4.3. Strategic planning and productive system design; 4.3.1. Group technology; 4.3.2. Locating equipment; 4.4. Tactical planning and inventory management; 4.4.1. A linear programming model for medium-term planning; 4.4.2. Inventory management; 4.4.3. Wagner and Whitin model; 4.4.4. The economic order quantity model (EOQ) 4.4.5. The EOQ model with joint replenishments4.5. Operations planning and scheduling; 4.5.1. Tooling; 4.5.2. Robotic cells; 4.6. Conclusion and perspectives; 4.7. Bibliography; Chapter 5. Operations Research and Goods Transportation; 5.1. Introduction; 5.2. Goods transport systems; 5.3. Systems design; 5.3.1. Location with balancing requirements; 5.3.2. Multiproduct production-distribution; 5.3.3. Hub location; 5.4. Long-distance transport; 5.4.1. Service network design; 5.4.2. Static formulations; 5.4.3. Dynamic formulations; 5.4.4. Fleet management; 5.5. Vehicle routing problems 5.5.1. Definitions and complexity |
Record Nr. | UNINA-9910809344503321 |
London, : ISTE | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Combinatorial Optimization [[electronic resource] ] : Second International Symposium, ISCO 2012, Athens, Greece, 19-21, Revised Selected Papers / / edited by A. Ridha Mahjoub, Vangelis Markakis, Ioannis Milis, Vangelis Th. Paschos |
Edizione | [1st ed. 2012.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
Descrizione fisica | 1 online resource (XIV, 476 p. 63 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Computer networks Discrete Mathematics in Computer Science Numerical Analysis Computer Communication Networks |
ISBN | 3-642-32147-X |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs -- Branch-and-Price Guided -- The New Faces of Combinatorial Optimization -- Models and Algorithms for the Train Unit Assignment Problem -- The Minimum Stabbing Triangulation Problem: IP Models and Computational Evaluation -- Using Symmetry to Optimize over the Sherali-Adams Relaxation -- A Second-Order Cone Programming Approximation to Joint Chance-Constrained Linear Programs -- Semidefinite Relaxations for Mixed 0-1 Second-Order Cone Program -- The Non-Disjoint m-Ring-Star Problem : Polyhedral Results and SDH/SONET Network Design.-The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks -- Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem -- Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols -- An Algebraic Approach to Symmetric Extended Formulations -- Dual Consistent Systems of Linear Inequalities and Cardinality Constrained Polytopes -- Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone.-The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks -- Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem -- Extended Formulations, Nonnegative Factorizations, and Randomized Communication -- An Algebraic Approach to Symmetric Extended.-On the Hop Constrained Steiner Tree Problem with Multiple Root.-Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs -- A Second-Order Cone Programming Approximation to Joint Chance-Constrained Linear Programs.-Extended Formulations, Nonnegative Factorizations, and Randomized Communication -- An Algebraic Approach to Symmetric Extended.-Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm. |
Record Nr. | UNISA-996465281103316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Combinatorial optimization [[electronic resource] ] . Volume 2 Paradigms of combinatorial optimization : problems and new approaches / / edited by Vangelis Th. Paschos |
Pubbl/distr/stampa | London, : ISTE, 2010 |
Descrizione fisica | 1 online resource (722 p.) |
Disciplina | 519.64 |
Altri autori (Persone) | PaschosVangelis Th |
Collana | ISTE |
Soggetto topico |
Combinatorial optimization
Programming (Mathematics) |
Soggetto genere / forma | Electronic books. |
ISBN |
1-118-60020-7
1-118-60027-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | pt. I. Paradigmatic problems -- pt. II. New approaches. |
Record Nr. | UNINA-9910141601103321 |
London, : ISTE, 2010 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|