56,434 Hits in 3.2 sec

Page 3495 of Mathematical Reviews Vol. , Issue 83h [page]

1983 Mathematical Reviews  
.; Schrijver, A. 83h:90071 Some combinatorial applications of the new linear programming algorithm.  ...  It turns out, however, that there is a really wide class of combinatorial problems which cannot be reduced ¢o linear programming and yet the method of the new linear programming algorithm can be applied  ... 

Genetic Algorithm for Airline Crew Scheduling Problem Using Cost-Based Uniform Crossover [chapter]

Ketan Kotecha, Gopi Sanghani, Nilesh Gambhava
2004 Lecture Notes in Computer Science  
CUC uses cost of the column information for generating offspring.  ...  SPP itself is highly constrained combinatorial optimization problem so no algorithm solves it in polynomial time.  ...  CUC uses cost of the column information for generating offspring.  ... 
doi:10.1007/978-3-540-30176-9_11 fatcat:x7jsdgrdybczlb5wsbl7kzwb6e

Combinatorial 3-Manifolds from Sets of Tetrahedra

Marco Attene, Massimo Ferri, Daniela Giorgi
2007 2007 International Conference on Cyberworlds (CW'07)  
We outline sufficient conditions on the mesh to guarantee the feasibility of the approach and we show how singularities can be both identified and removed according to the configuration of their link.  ...  Furthermore, we demonstrate that the algorithm can be implemented using a flexible state-of-the-art data structure for manifold tetrahedral meshes suitable for efficient and general applications.  ...  Acknowledgement This work has been supported by CNR research activity ICT-P03 and the European Network of Excellence FP6 IST  ... 
doi:10.1109/cw.2007.11 dblp:conf/cw/AtteneFG07 fatcat:efwhm5mc6jg7lhjbpfap7gcolq

Optimal partitioning of a square: a numerical approach

Supanut Chaidee, Wacharin Wichiramala
2016 ScienceAsia  
In particular, combinatorial patterns were generated using the triangulation of planar graphs.  ...  In this paper, the existence of solutions in a more general sense is established and the graphical transformation method is improved by generating dual graphs of the combinatorial patterns.  ...  Acknowledgements: The authors wish to thank the Development and Promotion of Science and Technology Talents Project by the Institute for the Promotion of Teaching Science and Technology, Ministry of Education  ... 
doi:10.2306/scienceasia1513-1874.2016.42.150 fatcat:vd4bikuafzenzgni4w4mxngita

Inserting an Edge into a Planar Graph

Carsten Gutwenger, Petra Mutzel, René Weiskircher
2005 Algorithmica  
Many problems concerned with the optimization over the set of all combinatorial embeddings of a planar graph turned out to be NP-hard.  ...  Alternatively, the problem can be stated as finding a planar combinatorial embedding of a planar graph G in which the given edge e can be inserted with the minimum number of crossings.  ...  Thereby, the task is to optimize over the set of all possible combinatorial embeddings of P.  ... 
doi:10.1007/s00453-004-1128-8 fatcat:pteako5g6zhe3o7k3cfqopvw2a

A Generic Implementation of dD Combinatorial Maps in CGAL

Guillaume Damiand, Monique Teillaud
2014 Procedia Engineering  
To the best of our knowledge, the Cgal software package presented here offers the only available generic implementation of combinatorial maps in any dimension.  ...  We present a generic implementation of dD combinatorial maps and linear cell complexes in Cgal, the Computational Geometry Algorithms Library.  ...  Thanks to Andreas Fabri, Sébastien Loriot, and Laurent Rineau for their help during the implementation of the two Cgal packages.  ... 
doi:10.1016/j.proeng.2014.10.372 fatcat:4y2sgdo5bfh5pozmozpsrdal7i

Optimizing over All Combinatorial Embeddings of a Planar Graph (Extended Abstract) [chapter]

Petra Mutzel, René Weiskircher
1999 Lecture Notes in Computer Science  
We study the problem of optimizing over the set of all combinatorial embeddings of a given planar graph. Our objective function prefers certain cycles of G as face cycles in the embedding.  ...  This system of linear inequalities can be constructed recursively using the data structure of SPQR-trees and a new splitting operation.  ...  Acknowledgements We thank the group of G.  ... 
doi:10.1007/3-540-48777-8_27 fatcat:o3wxj5r625h7tkcmqj3ufqoipu

Preface: The fourth International Symposium on Combinatorial Optimization (ISCO) 2016

Satoru Fujishige, A. Ridha Mahjoub, Franz Rendl
2018 Journal of combinatorial optimization  
ISCO is intended to be a forum for the exchange of recent scientific developments and for the discussion of new trends.The scope of the conference includes all aspects of combinatorial optimization ranging  ...  This special issue of Journal of Combinatorial Optimization is dedicated to the fourth International Symposium on Combinatorial Optimization (ISCO 2016), which took place in Vietri Sul Mare, Italy, on  ...  ISCO is intended to be a forum for the exchange of recent scientific developments and for the discussion of new trends.The scope of the conference includes all aspects of combinatorial optimization ranging  ... 
doi:10.1007/s10878-018-0360-0 fatcat:x3q5rtvcb5bynmgv4o7j4iivbm


Meng-Hiot Lim
2020 Memetic Computing  
This first issue of 2020 is a compilation of 5 papers. All the papers except for one, focus mainly on techniques or computational models for solving combinatorial optimization problems.  ...  The knapsack problem is a classical combinatorial optimization problems which is known to be NP-hard.  ...  The knapsack problem is a classical combinatorial optimization problems which is known to be NP-hard.  ... 
doi:10.1007/s12293-020-00299-1 fatcat:obgswymvn5eh7g77dbq3ptcnn4

Concluding Remarks [chapter]

2014 Combinatorial Maps  
Acknowledgements The authors wish to thank the following persons, who contributed to common works related to combinatorial maps: Ehoud Ahronovitz  ...  properties, illustrating optimization mechanisms; • the formal links between combinatorial maps and ordered models, combinatorial maps and incidence graphs, combinatorial maps and simplicial structures  ...  space; • optimization of operations.  ... 
doi:10.1201/b17403-14 fatcat:ropfk2sbqrgy3jqqvvuyauymgq

Combinatorial Optimization Model of Transmission Network Planning Projects Considering Comprehensive Benefit

Hongsheng Zhao, Qi Zou, Xiongguang Zhao
2018 DEStech Transactions on Environment Energy and Earth Science  
Combine Reliability Benefit with Economic Benefit as the Comprehensive Benefit, based on which a new combinatorial optimization model of transmission network planning projects is established.  ...  It provides a scientific and reasonable method for the combinatorial optimization of the transmission network planning projects. The validity of the method is verified in a case finally.  ...  In view of the facing problem, this paper proposes a combinatorial optimization model of transmission network planning projects considering Comprehensive Benefit.  ... 
doi:10.12783/dteees/appeec2018/23513 fatcat:xh77y5e6nner7ee2hmhfligfl4

Approximation algorithms for the bid construction problem in combinatorial auctions for the procurement of freight transportation contracts

Jiongjiong Song, Amelia Regan
2005 Transportation Research Part B: Methodological  
The bid valuation and construction problem for carriers facing these combinatorial auctions is very difficult and involves the computation of a number of NP-hard sub problems.  ...  The benefit of our approximation method is that it provides a way for carriers to discover their true costs and construct optimal or near optimal bids by solving a single NP-hard problem.  ...  Any opinions, findings and conclusions or recommendations expressed in this paper are those of the authors and do not necessarily reflect the views of the UCTC or the NSF.  ... 
doi:10.1016/j.trb.2004.11.003 fatcat:z5pny6x46rcsbiyrkvpth46h4y

Realizability and inscribability for simplicial polytopes via nonlinear optimization

Moritz Firsching
2017 Mathematical programming  
Surprisingly many of the realizable polytopes are also inscribable.  ...  We show that nonlinear optimization techniques can successfully be applied to realize and to inscribe matroid polytopes and simplicial spheres.  ...  For the help in Section 3.2 I thank Frank Lutz, who provided the list of triangulations and David  ... 
doi:10.1007/s10107-017-1120-0 fatcat:fhkhmutqxbf37lryaio7bnotf4

High-Throughput Screening Of Sofc Cathode Materials

Aitor Hornés, Aruppukotai Bhupathi Saranya, Alejandro Morata, Albert Tarancón
2016 Zenodo  
Searching for new improvements in SOFC technology, i.e. increase of performance and/or decrease of degradation; here we propose the preparation of novel SOFC cathode formulations by Combinatorial Pulsed  ...  Afterwards, evaluation of physicochemical and electrochemical properties of the generated samples will help to select an optimized composition for the proposed application.  ...  Conclusions • Combinatorial PLD deposition has been validated as highthroughput technique for fabrication of µSOFC cathode materials. • Ternary thin films show great crystalline homogeneity, nanometric  ... 
doi:10.5281/zenodo.159349 fatcat:fymxxdpvu5fpzbqphmzpoqk4xa

Incremental Updating of 3D Topological Maps to Describe Videos [chapter]

Guillaume Damiand, Sylvain Brandel, Donatello Conte
2015 Lecture Notes in Computer Science  
However the construction of a topological map for representing a video needs the availability of the complete image sequence.  ...  In this paper we propose a procedure for online updating a topological map in order to build it as the video is produced, allowing to use it in real time.  ...  Acknowledgment: This work has been partially supported by the French National Agency (ANR), project SoLStiCe ANR-13-BS02-0002-01.  ... 
doi:10.1007/978-3-319-26145-4_22 fatcat:oaflkwnmtjb6zjbqwhoupbkd5e
« Previous Showing results 1 — 15 out of 56,434 results