Academic literature on the topic 'Constrained cutting'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Constrained cutting.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Constrained cutting"
Lu, Zhenguo, Hongbin Wang, Qingliang Zeng, Zhiwen Wang, Lirong Wan, and Changjiang Li. "Research on Cutting Performance of Conical Pick Cutting Rock Plate with One Side Constrain and Three Sides Free." Science Progress 105, no. 1 (January 2022): 003685042210791. http://dx.doi.org/10.1177/00368504221079191.
Full textLiu, Gang, Ming Chen, Peng Nan Li, Qing Zhen Bi, and Bao Cai Guo. "Multi-Constrained Analysis of Metal Cutting and its Application." Key Engineering Materials 589-590 (October 2013): 38–44. http://dx.doi.org/10.4028/www.scientific.net/kem.589-590.38.
Full textPetrushin, S. I., and R. Kh Gubaidulina. "Chip Formation in Constrained Cutting." Russian Engineering Research 38, no. 8 (August 2018): 645–50. http://dx.doi.org/10.3103/s1068798x18080117.
Full textPetrushin, S. I., and A. V. Proskokov. "Theory and geometry of constrained cutting." Russian Engineering Research 29, no. 11 (November 2009): 1132–39. http://dx.doi.org/10.3103/s1068798x09110136.
Full textJuyong Zhang, Jianmin Zheng, and Jianfei Cai. "Interactive Mesh Cutting Using Constrained Random Walks." IEEE Transactions on Visualization and Computer Graphics 17, no. 3 (March 2011): 357–67. http://dx.doi.org/10.1109/tvcg.2010.57.
Full textHifi, Mhand, and Rym M'Hallah. "Approximate algorithms for constrained circular cutting problems." Computers & Operations Research 31, no. 5 (April 2004): 675–94. http://dx.doi.org/10.1016/s0305-0548(03)00020-0.
Full textHough, C. L., and Y. Chang. "Constrained Cutting Rate-Tool Life Characteristic Curve, Part 1: Theory and General Case." Journal of Manufacturing Science and Engineering 120, no. 1 (February 1, 1998): 156–59. http://dx.doi.org/10.1115/1.2830092.
Full textCui, Yue, Guo Hua Qin, and Hai Chao Ye. "Advanced Iterative Approach to Locating Point Layout for Computer Aided Fixture Design." Applied Mechanics and Materials 148-149 (December 2011): 403–8. http://dx.doi.org/10.4028/www.scientific.net/amm.148-149.403.
Full textKim, Jinhak, Mohit Tawarmalani, and Jean-Philippe P. Richard. "On cutting planes for cardinality-constrained linear programs." Mathematical Programming 178, no. 1-2 (June 6, 2018): 417–48. http://dx.doi.org/10.1007/s10107-018-1306-0.
Full textParada Daza, Víctor, Arlindo Gómes de Alvarenga, and José de Diego. "Exact solutions for constrained two-dimensional cutting problems." European Journal of Operational Research 84, no. 3 (August 1995): 633–44. http://dx.doi.org/10.1016/0377-2217(95)00028-o.
Full textDissertations / Theses on the topic "Constrained cutting"
Oberholzer, Jan Adriaan. "Implementing artificial intelligence search methods to solve constrained two-dimensional guillotine-cut cutting stock problems / by Jan Adriaan Oberholzer." Thesis, North-West University, 2003. http://hdl.handle.net/10394/392.
Full textThesis (Ph.D. (Computer Science))--North-West University, Potchefstroom Campus, 2004.
Cardozo, Arteaga Carmen. "Optimisation of power system security with high share of variable renewables : Consideration of the primary reserve deployment dynamics on a Frequency Constrained Unit Commitment model." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLC024/document.
Full textThe Unit Commitment problem (UC) is a family of optimisation models for determining the optimal short-term generation schedule to supply electric power demand with a defined risk level. The UC objective function is given by the operational costs over the optimisation horizon. The constraints include, among others, technical, operational and security limits. Traditionally, the security constraints are given by the requirement of a certain volume of on-line spare capacity, which is called the reserve and is meant to handle uncertainty, while preventing the interruption of power supply. It is commonly specified following a static reliability criterion, such as the N-1 rule.Nevertheless, in small systems the fixed, and a priori defined, reserve constraint could entail a violation of the N-1 criterion, although the reserve constraint was met. More recently, the increasing share of variable generation from renewable sources (V-RES), such as wind and solar, may lead to UC solutions that no longer ensure system security. Therefore, different impact mitigation techniques have been proposed in literature, which include the revision of UC models to provide a better representation of the system dynamics. This subfamily of UC models is formally defined in this work as the frequency constrained UC problem (FCUC), and aims to keep the frequency above a certain threshold, following pre-defined contingencies, by adding enhanced security constraints. In this work this topic is addressed in four parts.The first part identifies the main challenge of formulating the FCUC problem. Indeed, the frequency minimum, also called the frequency nadir, constraint is strongly non-linear on the decision variables of the UC model. Moreover, the behaviour of the frequency nadir regarding the binary decision variables is hard to approximate by analytical functions. Thus, a sequential simulation approach is proposed, based on a classic UC model and a reduced order model of the primary frequency response. The potential benefits of a smarter allocation of the primary reserve is revealed.The second part of this work investigates the impact of V-RES sources on the primary frequency response. The underlying processes that lead to the increase of the Under-Frequency Load Shedding (UFLS) risk are thoroughly discussed. The need of formulating more accurate FCUC models is highlighted.The third part of this work examines the cost/benefit and limitation of FCUC models based on indirect constraints over certain dynamic parameters of the generating units. A methodology is proposed that assesses the effectiveness and optimality of some existing V-RES impact mitigation techniques, such as the increase of the primary reserve requirement, the prescription of an inertia requirement, the authorisation of V-RES dispatch-down or the consideration of fast non-synchronous providers of frequency regulation services. This study showed the need for new methods to properly handle the frequency nadir constraint in order to ensure optimality, without compromising the optimisation problem’s tractability.The fourth part of this work offers a new formulation of the FCUC problem following a Bender’s decomposition approach. This method is based on the decomposition of an optimisation problem into two stages: the master and the slave problems. Here, the master problem deals with the generating unit states and the slave problem handles the frequency nadir constraints through a cutting plane model. Simulation results showed that the more accurate representation of the frequency nadir in the slave problem reduces the risk of UFLS and the security cost, with respect to other FCUC models, such as those based on inertia constraints. In addition, the optimality of the global solution is guaranteed; although the convergence of the master problem is slow, due to the well-known tailing off effect of cutting plane methods
Soberanis, Policarpio Antonio. "Risk optimization with p-order conic constraints." Diss., University of Iowa, 2009. https://ir.uiowa.edu/etd/437.
Full textVitor, Fabio Torres. "Improving the solution time of integer programs by merging knapsack constraints with cover inequalities." Thesis, Kansas State University, 2015. http://hdl.handle.net/2097/19226.
Full textDepartment of Industrial and Manufacturing Systems Engineering
Todd Easton
Integer Programming is used to solve numerous optimization problems. This class of mathematical models aims to maximize or minimize a cost function restricted to some constraints and the solution must be integer. One class of widely studied Integer Program (IP) is the Multiple Knapsack Problem (MKP). Unfortunately, both IPs and MKPs are NP-hard, potentially requiring an exponential time to solve these problems. Utilization of cutting planes is one common method to improve the solution time of IPs. A cutting plane is a valid inequality that cuts off a portion of the linear relaxation space. This thesis presents a new class of cutting planes referred to as merged knapsack cover inequalities (MKCI). These valid inequalities combine information from a cover inequality with a knapsack constraint to generate stronger inequalities. Merged knapsack cover inequalities are generated by the Merging Knapsack Cover Algorithm (MKCA), which runs in linear time. These inequalities may be improved by the Exact Improvement Through Dynamic Programming Algorithm (EITDPA) in order to make them stronger inequalities. Theoretical results have demonstrated that this new class of cutting planes may cut off some space of the linear relaxation region. A computational study was performed to determine whether implementation of merged knapsack cover inequalities is computationally effective. Results demonstrated that MKCIs decrease solution time an average of 8% and decrease the number of ticks in CPLEX, a commercial IP solver, approximately 4% when implemented in appropriate instances.
Yahiaoui, Ala-Eddine. "Selective vehicle routing problem : cluster and synchronization constraints." Thesis, Compiègne, 2018. http://www.theses.fr/2018COMP2449/document.
Full textThe Vehicle Routing Problem (VRP) is a family of Combinatorial Optimization Problems generally used to solve different issues related to transportation systems and logistics. In this thesis, we focused our attention on a variant of the VRP called the Team Orienteering Problem (TOP). In this family of problems, it is a priory impossible to visit all the customers due to travel time limitation on vehicles. Instead, a profit is associated with each customer to represent its value and it is collected once the customer is visited by one of the available vehicles. The objective function is then to maximize the total collected profit with respect to the maximum travel time. Firstly, we introduced a new generalization for the TOP that we called the Clustered TOP (CluTOP). In this variant, the customers are grouped into subsets called clusters to which we associate profits. To solve this variant, we proposed an exact scheme based on the cutting plane approach with additional valid inequalities and pre-processing techniques. We also designed a heuristic method based on the order first-cluster second approach for the CluTOP. This Hybrid Heuristic combines between an ANLS heuristic that explores the solutions space and a splitting procedure that explores the giant tours search space. In addition, the splitting procedure is enhanced by local search procedure in order to enhance its coverage of search space. The second problem treated in this work is called the Synchronized Team Orienteering Problem with Time Windows (STOPTW). This variant was initially proposed in order to model scenarios related to asset protection during escaped wildfires. It considers the case of a heterogeneous fleet of vehicles along with time windows and synchronized visits. To solve this problem, we proposed a heuristic method based on the GRASP×ILS approach that led to a very outstanding results compared to the literature. The last variant of the TOP tackled in this thesis called the Set Orienteering Problem (SOP). Customers in this variant are grouped into subsets called clusters. Each cluster is associated with a profit which is gained if at least one customer is served by the single available vehicle. We proposed a Branch-and-Cut with two separation procedures to separate subtours elimination constraints. We also proposed a Memetic Algorithm with an optimal splitting procedure based on dynamic programming
Carvalho, Alexandre Augusto Martins. "Proposta metodologica para racionalização de ociosidade fabril /." Guaratinguetá, 2019. http://hdl.handle.net/11449/182420.
Full textResumo: Ambientes industriais são altamente competitivos. Fatores como a agilidade, a flexibilidade, a prestação de serviços, a qualidade e preços são as vantagens competitivas procuradas pelas organizações. Neste cenário, as otimizações propostas que abordam tais fatores são de particular interesse para o planejamento de processos. O procedimento proposto tratado é o resultado líquido direto e o aumento da competitividade no mercado de uma determinada empresa, visando que sua estrutura financeira seja a mais saudável possível. Este trabalho tem como objetivo auxiliar e desenvolver um procedimento padrão de verificação do nível de rentabilidade de uma empresa e ainda, se esta empresa tem a probabilidade de tornar-se mais rentável. Tal procedimento visa atingir um segundo objetivo no sentido de maximizar os recursos já existentes na própria organização. O aspecto chave desta pesquisa diz respeito à utilização de máquina com tempos ociosos e plena utilização de todos os sistemas disponíveis de fábrica. Quando a ociosidade destas máquinas utilizadas em pleno processo produtivo, é possível concluir como resultado das aplicações realizadas, uma maximização dos recursos propiciando o melhor resultado da organização. Esta ociosidade quando não apurada com a devida acurácia é lançada indevidamente nos custos dos produtos, fazendo com que a empresa possa perder competitividade
Abstract: Industrial environments are highly competitive. Factors such as agility, flexibility, service delivery, quality and prices are the competitive advantages sought by organizations. In this scenario, the proposed optimizations that address such factors are of particular interest for process planning. The proposed procedure is the direct net result and the increase of the competitiveness in the market of a certain company, aiming that its financial structure is as healthy as possible. This work aims to assist and develop a standard procedure for verifying the level of profitability of a company and still, if this company has the probability of becoming more profitable. This procedure aims to achieve a second objective in order to maximize resources already existing in the organization itself. The key aspect of this research concerns the use of idling machines and full utilization of all the systems available from the factory. When the idleness of these machines used in full productive process, it is possible to conclude as a result of the applications made, a maximization of the resources propitiating the best result of the organization. This idleness when not verified with the correct accuracy is improperly thrown into the costs of the products, causing the company to lose competitiveness
Doutor
Hellman, Fredrik. "Towards the Solution of Large-Scale and Stochastic Traffic Network Design Problems." Thesis, Uppsala University, Department of Information Technology, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-130013.
Full textThis thesis investigates the second-best toll pricing and capacity expansion problems when stated as mathematical programs with equilibrium constraints (MPEC). Three main questions are rised: First, whether conventional descent methods give sufficiently good solutions, or whether global solution methods are to prefer. Second, how the performance of the considered solution methods scale with network size. Third, how a discretized stochastic mathematical program with equilibrium constraints (SMPEC) formulation of a stochastic network design problem can be practically solved. An attempt to answer these questions is done through a series ofnumerical experiments.
The traffic system is modeled using the Wardrop’s principle for user behavior, separable cost functions of BPR- and TU71-type. Also elastic demand is considered for some problem instances.
Two already developed method approaches are considered: implicit programming and a cutting constraint algorithm. For the implicit programming approach, several methods—both local and global—are applied and for the traffic assignment problem an implementation of the disaggregate simplicial decomposition (DSD) method is used. Regarding the first question concerning local and global methods, our results don’t give a clear answer.
The results from numerical experiments of both approaches on networks of different sizes shows that the implicit programming approach has potential to solve large-scale problems, while the cutting constraint algorithm scales worse with network size.
Also for the stochastic extension of the network design problem, the numerical experiments indicate that implicit programming is a good approach to the problem.
Further, a number of theorems providing sufficient conditions for strong regularity of the traffic assignment solution mapping for OD connectors and BPR cost functions are given.
Abrantes, Ricardo Luiz de Andrade. "Problemas de corte com sobras aproveitáveis e eliminação de simetrias." Universidade de São Paulo, 2012. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-16122012-183550/.
Full textIn this work we study two variations of the packing problem where identical rectangular items must be packed into a polyhedron. One of the variations consists in finding the largest amount of rectangular items that can fit in a polyhedron. The other one consists in finding a minimal area polyhedron of a certain type that packs a set of rectangular identical items. We present some symmetry-breaking constraints that reduce the computational effort in solving those problems through a branch-&-bound method. We also studied the cutting stock problem where there are some items to be cut from a set of rectangular objects and we need to satisfy the demand of items to be cut minimizing the cost of the used objects and, among the different ways of doing this, we want that which maximize the usable leftovers. Loosely speaking,usable leftovers can be understood as rectangular regions in an object that has the width and the height greater than or equal to the ones of a reference item. These leftovers can be seen as leftovers from a cutting process that will become items in a new cutting process. We present bilevel programming models to two variations of this problem with usable leftovers: the two-stage cutting stock problem of rectangular items and the non-guillotine cutting stock problem of rectangular items. In order to solve the proposed models we present also MIP reformulations of these bilevel programming problem models. We also developed some symmetry breaking constraints in order to accelerate the solving process of those models. The developed models were computationally programmed and we were able to solve small instances of the proposed problems
Hokama, Pedro Henrique Del Bianco 1986. "O problema do caixeiro viajante com restrições de empacotamento tridimensional." [s.n.], 2011. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275722.
Full textDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação
Made available in DSpace on 2018-08-19T18:16:55Z (GMT). No. of bitstreams: 1 Hokama_PedroHenriqueDelBianco_M.pdf: 1340789 bytes, checksum: b5cc3f26e41b90afabdfac5c7a33bf05 (MD5) Previous issue date: 2011
Resumo: Nesta dissertação de mestrado apresentamos um método exato para o Problema do Caixeiro Viajante com Restrições de Empacotamento Tridimensional, que combina o Problema do Caixeiro Viajante o Problema de Empacotamento Tridimensional com Restrição de Ordem. Neste problema, um veículo deve partir carregado de um depósito e entregar caixas em pontos pré-definidos para seus clientes. Cada cliente tem um conjunto de caixas que deve receber e o objetivo é minimizar o custo de deslocamento do veículo. As caixas devem ser retiradas a partir da porta do contêiner do veículo e a remoção das caixas de um cliente não podem ser obstruídas pelas caixas a serem descarregadas posteriormente. Propomos uma abordagem exata baseada em branch-and-cut para buscar uma rota de custo mínimo. Apresentamos algumas adaptações de algoritmos da literatura e uma formulação em Programação por Restrições para encontrar um empacotamento que obedece restrições de ordem. Realizamos testes computacionais em instâncias geradas aleatoriamente e comparamos resultados com os algoritmos adaptados da literatura. Os resultados foram bastante satisfatórios resolvendo instâncias de tamanho médio em tempo computacional aceitável na prática
Abstract: We present an exact method for the Traveling Salesman Problem with Three-dimensional Loading Constraints. This problem combines the Traveling Salesman Problem, and the Three- Dimensional Packing Problem With Loading Constraints. In this problem, a vehicle must be loaded at the depot and deliver boxes to the customers. Every customer has a set of boxes that should receive and our goal is to minimize the travel cost of the vehicle. Unloading is done through a single side of the container and items from an unloading customer must not be blocked by items to be delivered later. We propose exact and heuristic branch-and-cut algorithm to find a minimum cost route. Adaptations of algorithms from the literature and a Constraint Programming formulation is presented to find a packing that consider unloading contraints. We performed computational tests on instances randomly generated and compared results with the algorithms adapted from literature. The results were quite satisfactory resolving several instances in reasonable computational time
Mestrado
Ciência da Computação
Mestre em Ciência da Computação
Mesyagutov, Marat. "Exact Approaches for Higher-Dimensional Orthogonal Packing and Related Problems." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2014. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-137905.
Full textEs werden NP-schwere höherdimensionale orthogonale Packungsprobleme betrachtet. Wir untersuchen ihre logische Struktur genauer und zeigen, dass sie sich in Probleme kleinerer Dimension mit einer speziellen Nachbarschaftsstruktur zerlegen lassen. Dies beeinflusst die Modellierung des Packungsprozesses, die ihreseits zu drei neuen Lösungsansätzen führt. Unter Beachtung dieser Zerlegung modellieren wir die Probleme kleinerer Dimension in einer einzigen positionsindizierten Formulierung mit Nichtüberlappungsungleichungen, die als Bindungsbedingungen dienen. Damit entwickeln wir ein neues Modell der ganzzahligen linearen Optimierung und unterziehen dies einer Polyederanalyse. Weiterhin geben wir allgemeine Nichtüberlappungs- und Dichtheitsungleichungen an und beweisen unter geeigneten Annahmen ihre facettendefinierende Eigenschaft für die konvexe Hülle der ganzzahligen Lösungen. Basierend auf dem vorgeschlagenen Modell und den starken Ungleichungen entwickeln wir einen neuen Branch-and-Cut-Algorithmus. Jedes Problem kleinerer Dimension ist eine Relaxation des höherdimensionalen Problems. Darüber hinaus besitzt es Anwendungen in verschiedenen Bereichen, wie zum Beispiel im Scheduling. Für die Behandlung der Probleme kleinerer Dimension setzen wir das Gilmore-Gomory-Modell ein, das eine Dantzig-Wolfe-Dekomposition der positionsindizierten Formulierung ist. Um eine Nachbarschaftsstruktur zu erhalten, muss die Basismatrix der optimalen Lösung die consecutive-1’s-Eigenschaft erfüllen. Für die Konstruktion solcher Matrizen entwickeln wir neue Branch-and-Price-Algorithmen, die sich durch Strategien zur Enumeration von partiellen Lösungen unterscheiden. Wir beweisen auch einige Charakteristiken von partiellen Lösungen, die das Hilfsproblem der Spaltengenerierung verschärfen. Für die nichtlineare Modellierung der höherdimensionalen Packungsprobleme untersuchen wir moderne Ansätze des Constraint Programming, modifizieren diese und schlagen neue Dichotomie- und Überschneidungsstrategien für die Verzweigung vor. Für die Verstärkung der Constraint Propagation stellen wir neue Ablehnungskriterien vor. Wir nutzen dabei 1D Relaxationen mit Intervallen und verbotenen Paaren, erweiterte Streifen-Relaxation, 2D Scheiben-Relaxation und 1D Scheiben-Streifen-Relaxation mit verbotenen Paaren. Alle vorgestellten Kriterien basieren auf Relaxationen durch Probleme kleinerer Dimension, die wir weiter durch die LP-Relaxation des Gilmore-Gomory-Modells abschwächen. Wir schließen mit Umsetzungsfragen und numerischen Experimenten aller vorgeschlagenen Ansätze
Books on the topic "Constrained cutting"
Neeleman, Ad, and Hans van de Koot. Word Order and Information Structure. Edited by Caroline Féry and Shinichiro Ishihara. Oxford University Press, 2015. http://dx.doi.org/10.1093/oxfordhb/9780199642670.013.20.
Full textThomas, Christopher R., and William F. Shughart, eds. The Oxford Handbook of Managerial Economics. Oxford University Press, 2013. http://dx.doi.org/10.1093/oxfordhb/9780199782956.001.0001.
Full textHoudé, Olivier, and Grégoire Borst, eds. The Cambridge Handbook of Cognitive Development. Cambridge University Press, 2022. http://dx.doi.org/10.1017/9781108399838.
Full textButton, Chris, Ludovic Seifert, Jia Yi Chow, Duarte Araújo, and Keith Davids. Dynamics of Skill Acquisition. 2nd ed. Human Kinetics, 2021. http://dx.doi.org/10.5040/9781718214125.
Full textClasen, Mathias. Why Horror Seduces. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780190666507.001.0001.
Full textBook chapters on the topic "Constrained cutting"
Banta, M., M. Mäntylä, M. Inuit, and F. Kimura. "Cutting and pasting constrained boundary features." In Computer Applications in Production Engineering, 35–44. Boston, MA: Springer US, 1995. http://dx.doi.org/10.1007/978-0-387-34879-7_4.
Full textRusso, Mauro, Antonio Sforza, and Claudio Sterle. "Upper Bounds Categorization for Constrained Two-Dimensional Guillotine Cutting." In Springer Proceedings in Mathematics & Statistics, 461–72. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-67308-0_47.
Full textJonatã, Luiz, Piresde Araújo, and Plácido Rogério Pinheiro. "Applying Backtracking Heuristics for Constrained Two-Dimensional Guillotine Cutting Problems." In Information Computing and Applications, 113–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25255-6_15.
Full textClaßen, Grit, David Coudert, Arie M. C. A. Koster, and Napoleão Nepomuceno. "A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks." In Lecture Notes in Computer Science, 37–42. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21527-8_5.
Full textTschöke, Stefan, and Norbert Holthöfer. "A new parallel approach to the constrained two-dimensional cutting stock problem." In Parallel Algorithms for Irregularly Structured Problems, 285–300. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60321-2_24.
Full textBespamyatnikh, Sergei, and David Kirkpatrick. "Constrained Equitable 3-Cuttings." In Discrete and Computational Geometry, 72–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-44400-8_8.
Full textSchutt, Andreas, Peter J. Stuckey, and Andrew R. Verden. "Optimal Carpet Cutting." In Principles and Practice of Constraint Programming – CP 2011, 69–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23786-7_8.
Full textFischer, Andreas, and Guntram Scheithauer. "Cutting and Packing Problems with Placement Constraints." In Optimized Packings with Applications, 119–56. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-18899-7_6.
Full textFocacci, Filippo, Andrea Lodi, and Michela Milano. "Cutting Planes in Constraint Programming: An Hybrid Approach." In Principles and Practice of Constraint Programming – CP 2000, 187–201. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-45349-0_15.
Full textSaikko, Paul, Brandon Malone, and Matti Järvisalo. "MaxSAT-Based Cutting Planes for Learning Graphical Models." In Integration of AI and OR Techniques in Constraint Programming, 347–56. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-18008-3_24.
Full textConference papers on the topic "Constrained cutting"
Luo, X. N., and Q. Zhang. "Sliding Mode Controller for Force Constrained Cutting Process." In 1990 American Control Conference. IEEE, 1990. http://dx.doi.org/10.23919/acc.1990.4790918.
Full textGuo, Yang, Jisheng Chen, and Amr Saleh. "In Situ Analysis of Deformation Mechanics of Constrained Cutting Towards Enhanced Material Removal." In ASME 2019 14th International Manufacturing Science and Engineering Conference. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/msec2019-2970.
Full textYao, Min, Peng Zhang, Yin Li, Jie Hu, Chuang Lin, and Xiang Yang Li. "Cutting Your Cloud Computing Cost for Deadline-Constrained Batch Jobs." In 2014 IEEE International Conference on Web Services (ICWS). IEEE, 2014. http://dx.doi.org/10.1109/icws.2014.56.
Full textChen, Y., T. Sato, and T. Shiina. "A cutting-plane solution for chance-constrained unit commitment problems." In 2022 12th International Congress on Advanced Applied Informatics (IIAI-AAI). IEEE, 2022. http://dx.doi.org/10.1109/iiaiaai55812.2022.00126.
Full textHifi, Mhand, and Toufik Saadi. "A Cooperative Algorithm for Constrained Two-staged 2D Cutting Problems." In 2006 International Conference on Service Systems and Service Management. IEEE, 2006. http://dx.doi.org/10.1109/icsssm.2006.320756.
Full textJianhua Ma. "Mutation Ant Colony Algorithms of Constrained Two-dimensional Guillotine Cutting Problems." In 2006 6th World Congress on Intelligent Control and Automation. IEEE, 2006. http://dx.doi.org/10.1109/wcica.2006.1712925.
Full textYou, Sixiong, Changhuang Wan, and Ran Dai. "A Complementary Cutting Plane Approach for Nonconvex Quadratically Constrained Quadratic Programs." In 2018 IEEE Conference on Decision and Control (CDC). IEEE, 2018. http://dx.doi.org/10.1109/cdc.2018.8619462.
Full textHifi, M., S. Negre, and T. Saadi. "A parallel algorithm for constrained fixed two-staged two-dimensional cutting/packing problems." In Industrial Engineering (CIE39). IEEE, 2009. http://dx.doi.org/10.1109/iccie.2009.5223664.
Full textWang, Yi-Chi, Ming-Jun Wang, and Sung-Chi Lin. "Optimization of cutting parameters for parallel machine scheduling with constrained power demand peak." In International FAIM Conference. DEStech Publications, Inc., 2014. http://dx.doi.org/10.14809/faim.2014.0267.
Full textDing, Qia, Jun Ye, Mengchang Wang, Yantao Zhang, Chunling Lu, and Wen Wang. "An Integer Variable Reduction and Neighborhood Search Cutting Plane Method for Security Constrained Unit Commitment." In 2022 4th International Conference on Power and Energy Technology (ICPET). IEEE, 2022. http://dx.doi.org/10.1109/icpet55165.2022.9918470.
Full textReports on the topic "Constrained cutting"
Smith, I. R. Surficial geology, La Biche River northwest, Yukon-Northwest Territories, NTS 95-C/11, 12, 13, and 14. Natural Resources Canada/CMSS/Information Management, 2022. http://dx.doi.org/10.4095/330591.
Full textCarpenter, Marie, and William Lazonick. The Pursuit of Shareholder Value: Cisco’s Transformation from Innovation to Financialization. Institute for New Economic Thinking Working Paper Series, February 2023. http://dx.doi.org/10.36687/inetwp202.
Full text