1,722,656 research outputs found
On finding Min-Min disjoint paths
No full textThe Min-Min problem of finding a disjoint-path pair with the length of the shorter path minimized is known to be NP-hard and admits no K-approximation for any K>1 in the general case (Xu et al. in IEEE/ACM Trans. Netw. 14:147–158, 2006). In this paper, we first show that Bhatia et al.’s NP-hardness proof (Bhatia et al. in J. Comb. Optim. 12:83–96, 2006), a claim of correction to Xu et al.’s proof (Xu et al. in IEEE/ACM Trans. Netw. 14:147–158, 2006), for the edge-disjoint Min-Min problem in the general undirected graphs is incorrect by giving a counter example that is an unsatisfiable 3SAT instance but classified as a satisfiable 3SAT instance in the proof of Bhatia et al. (J. Comb. Optim. 12:83–96, 2006). We then gave a correct proof of NP-hardness of this problem in undirected graphs. Finally we give a polynomial-time algorithm for the vertex disjoint Min-Min problem in planar graphs by showing that the vertex disjoint Min-Min problem is polynomially solvable in st-planar graph G=(V,E) whose corresponding auxiliary graph G(V,E∪{e(st)}) can be embedded into a plane, and a planar graph can be decomposed into several st-planar graphs whose Min-Min paths collectively contain a Min-Min disjoint-path pair between s and t in the original graph G. To the best of our knowledge, these are the first polynomial algorithms for the Min-Min problems in planar graphs.Longkun Guo, Hong She
Solving Smooth Min-Min and Min-Max Problems by Mixed Oracle Algorithms
Full text linkIn this paper, we consider two types of problems that have some similarity in their structure, namely, min-min problems and min-max saddle-point problems. Our approach is based on considering the outer minimization problem as a minimization problem with inexact oracle. This inexact oracle is calculated via inexact solution of the inner problem, which is either minimization or a maximization problem. Our main assumptions are that the problem is smooth and the available oracle is mixed: it is only possible to evaluate the gradient w.r.t. the outer block of variables which corresponds to the outer minimization problem, whereas for the inner problem only zeroth-order oracle is available. To solve the inner problem we use accelerated gradient-free method with zeroth-order oracle. To solve the outer problem we use either inexact variant of Vaydya's cutting-plane method or a variant of accelerated gradient method. As a result, we propose a framework that leads to non-asymptotic complexity bounds for both min-min and min-max problems. Moreover, we estimate separately the number of first- and zeroth-order oracle calls which are sufficient to reach any desired accuracy
EFEKTIVITAS PENGGUNAAN METODE MIN-MIN SOLUTION TERHADAP HASIL BELAJAR SISWA
Full text linkAbstract: This research aims to measure the effectiveness of the Min-min Solution method in optimizing student learning outcomes in temperature conversion material. The research was carried out using an experimental approach, through collecting data from Pre-Test and Post-Test questions. Based on analysis of value data using the Paired T Test, a Sig (2-tailed) value of 0.000 was obtained, which means it is smaller than ½ α (0.025). This illustrates a significant change in the Pre-Test and Post-Test scores. These results mean that the Min-min Solution method has a positive influence on improving Post-Test results. Therefore, it is concluded that the application of the Min-min Solution method is effective in optimizing the physics learning outcomes of class IX students at SMP Negeri 2 Bandar Surabaya
Min-min Solution Sebagai Metode Konversi Skala Termometer
Full text linkAbstrakSuhu merupakan suatu besaran yang digunakan untuk mengetahui perubahan energi kinetik suatu molekul/zat, sedangkan termometer merupakan alat yang digunakan untuk mengukur suhu suatu benda. Skala termometer terdiri dari empat jenis, yaitu Celsius, Fahrenheit, Reamur, dan Kelvin. Selama ini persamaan yang digunakan untuk mengubah nilai pada skala-skala antara satu dengan yang lainnya masih menggunakan prinsip hafalan yang cukup banyak. Dalam hal memperkenalkan fisika pada peserta didik tentu hal ini menjadi masalah, karena fisika itu harus dapat dipelajari dengan metode yang mengutamakan kreativitas peserta didik. Metode min-min solution menawarkan kepada para pendidik agar memudahkan dalam penyampaian persamaan konversi suhu tanpa harus banyak menghafal, serta digunakan sebagai pengembangan pola pikir peserta didik. Metode ini hanya menggunakan dua buah prinsip yang telah diketahui secara luas, yaitu: 1. Perbandingan skala pada termometer, serta 2. Batas bawah masing-masing skala pada termometer.Kata Kunci: Konversi Skala, Skala Termometer, Min-min Solution AbstractTemperature is a measure used to see changes in the kinetic energy of a molecule / substance, while the thermometer is a tool used to measure the temperature of an object. Thermometer scale consists of four types, namely Celsius, Fahrenheit, Reamur, and Kelvin. So far, the equations used to change the values on the scale from one another still use quite a lot of memorization principles. In terms of physics, of course this is a problem, because physics must learn with a method that prioritizes the creativity of students. The min-min method solution offers educators to facilitate the delivery of temperature conversion equations without having to memorize a lot, and is used as a development of the students' mindset. This method only uses two principles that are widely known, namely: 1. Comparison of the scale on the thermometer, and 2. The lower limit of each scale on the thermometer.Keywords: Conversion Scale, Thermometer Scale, Min-min Solutio
The Max-Min-Min Principle of Product Differentiation
No full textWe analyze two and three-dimensional variants of Hotelling's model of differentiated products. In our setup, consumers can place different importance on each product attribute; this is measured by a weight in the disutility of distance in each dimension. Two firms play a two-stage game; they choose locations in stage 1 and prices in stage 2. We seek subgame-perfect equilibria. We find that all such equilibria have maximal differentiation in one dimension only; in all other dimensions, they have minimum differentiation. An equilibrium with maximal differentiation in a certain dimension occurs when consumers place sufficient importance (weight) on that attribute. Thus, depending on the importance consumers place on each attribute, in two dimensions there is a max-min equilibrium, a min-max equilibrium, or both. In three dimensions, depending on the weights, there can be a max-min-min equilibrium, a min-max-min equilibrium, a min-min-max equilibrium, any two of them, or all three.
The Max-Min-Min Principle of Product Differentiation
Full text linkWe analyze two and three-dimensional variants of Hotelling’s model of differentiated products. In our setup, consumers can place different importance on each product attribute; this is measured by a weight in the disutility of distance in each dimension. Two firms play a two-stage game; they choose locations in stage 1 and prices in stage 2. We seek subgame-perfect equilibria. We find that all such equilibria have maximal differentiation in one dimension only; in all other dimensions, they have minimum differentiation. An equilibrium with maximal differentiation in a certain dimension occurs when consumers place sufficient importance (weight) on that attribute. Thus, depending on the importance consumers place on each attribute, in two dimensions there is a max-min equilibrium, a min-max equilibrium, or both. In three dimensions, depending on
the weights, there can be a max-min-min equilibrium, a min-max-min equilibrium, a min-min-max equilibrium, any two of them, or all three
Effect of Digital Transformation on Employee Performance at City Properties Co., Ltd (Min Min, 2025)
Full text linkThis study aims to examine the effect of digital transformational leadership, organizational agility, and organizational culture on digital transformation, to analyze the moderating effect of digital strategy on the relationship between digital transformational leadership and digital transformation, as well as between organizational agility and digital transformation. Furthermore, the study investigates the mediating effect of digital transformation on the relationship between organizational culture and employee performance at City Properties Co., Ltd. This study uses both primary and secondary data. Primary data is collected from 184 employees of City Properties Co., Ltd. through online survey method using a structured questioners with a five-point Likert scale. The sample is selected through simple random sampling from 184 a total of workforce of 350 employees. Secondary data are obtained from textbooks, academic journals, and credible online sources. Descriptive statistics and regression analysis are employed to analyze the data. Base on the regression results, organizational agility and organizational culture have positive and significant effect on digital transformation. There is no moderating effect of digital strategy on the relationship between digital transformational leadership and digital transformation. There is no moderating effect of digital strategy on the relationship between organizational agility and digital transformation. There is the mediating effect of digital transformation on the relationship between organizational culture and employee performance. It is recommended that City Properties Co., Ltd. should focus on strengthening its organizational culture and agility to enhance digital transformation efforts. This, in turn, is expected to improve employee performance and support long-term competitive advantage
On the complexity of the edge-disjoint min-min problem in planar digraphs
No full textThe min-min problem of finding a disjoint path pair with the length of the shorter path minimized is known to be NP-complete (Xu et al., 2006) [1]. In this paper, we prove that in planar digraphs the edge-disjoint min-min problem remains NP-complete and admits no K-approximation for any K>1 unless P=NP. As a by-product, we show that this problem remains NP-complete even when all edge costs are equal (i.e., stronglyNP-complete). To our knowledge, this is the first NP-completeness proof for the edge-disjoint min-min problem in planar digraphs. © 2012 Elsevier B.V. All rights reserved.Longkun Guo, Hong She
Set-Based Min-Max and Min-Min Robustness for Multi-Objective Robust Optimization
No full textMin-max and min-min robustness are two extreme approaches discussed for single-objective robust optimization problems. Recently, multi-objective robust optimization problems are studied and robust Pareto efficiency definitions have been proposed. In particular, the set-based min-max robust efficiency defined for multi-objective robust optimization problems is analogous to the min-max robust optimality definition for single-objective robust optimization problems. In this study, we define the set-based min-min robust efficiency in addition to the existing definition of the min-max robust efficiency for multi-objective robust optimization problems. We discuss a method to determine the set of set-based min-max robust efficient solutions and propose an evolutionary algorithm to approximate this set. Furthermore, a modification of the algorithm is discussed to approximate the set of set-based min-min robust Pareto efficient solutions. The outcomes based on the two robust efficiency, i.e., set-based min-max and set-based min-min, are compared using numerical examples. Our results show that set-based min-min robust efficiency can be used by optimistic decision makers and can be combined with set-based min-max robust efficiency to model the preferences of the decision makers, who are not ultimately pessimistic
- …
