Pages that link to "Item:Q1278952"

The following pages link to A note on a global approach for general 0-1 fractional programming (Q1278952):

Displaying 46 items.

• Global solutions to fractional programming problem with ratio of nonconvex functions (Q299415) (← links)
• Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems (Q439496) (← links)
• Model-based decision support for optimal brochure pricing: applying advanced analytics in the tour operating industry (Q480749) (← links)
• A branch-and-cut algorithm for the latent-class logit assortment problem (Q496669) (← links)
• Finding checkerboard patterns via fractional 0-1 programming (Q604870) (← links)
• A short note on the mixed (0,\,1) linear fractional programming problem (Q698593) (← links)
• A review of choice-based revenue management: theory and methods (Q724103) (← links)
• Optimization and data mining in medicine (Q845564) (← links)
• Linearization of a 0-1 quadratic fractional programming problem (Q998699) (← links)
• The equitable dispersion problem (Q1011261) (← links)
• The attractive traveling salesman problem (Q1043335) (← links)
• A global approach for general \(0-1\) fractional programming (Q1328656) (← links)
• Mixed integer programming for the 0--1 maximum probability model. (Q1426689) (← links)
• Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
• A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems (Q1694780) (← links)
• A note on linearized reformulations for a class of bilevel linear integer problems (Q1730617) (← links)
• An approximate approach for fractional programming with absolute-value functions (Q1763230) (← links)
• On complexity of unconstrained hyperbolic 0--1 programming problems (Q1779713) (← links)
• On the posynomial fractional programming problems (Q1848628) (← links)
• Solving the competitive discretionary service facility location problem (Q1869391) (← links)
• Product line optimization in the presence of preferences for compromise alternatives (Q2028774) (← links)
• Railway delay management with passenger rerouting considering train capacity constraints (Q2028881) (← links)
• Time variant multi-objective linear fractional interval-valued transportation problem (Q2132736) (← links)
• A geometric branch-and-bound algorithm for the service bundle design problem (Q2160490) (← links)
• A multicut outer-approximation approach for competitive facility location under random utilities (Q2178115) (← links)
• Integrated express shipment service network design with customer choice and endogenous delivery time restrictions (Q2239996) (← links)
• Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations (Q2274883) (← links)
• The maximum ratio clique problem (Q2356159) (← links)
• General 0-1 fractional programming with conditional fractional terms for design of food frequency questionnaires (Q2376723) (← links)
• Formulating the mixed integer fractional posynomial programming (Q2496065) (← links)
• Project prioritization under policy restrictions. A combination of MCDA with 0-1 programming (Q2576271) (← links)
• Feature selection for consistent biclustering via fractional 0-1 programming (Q2576438) (← links)
• On the linear integration of attraction choice models in business optimization problems (Q2661954) (← links)
• Spatial and temporal optimization for smart warehouses with fast turnover (Q2664446) (← links)
• Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems (Q2810107) (← links)
• A branch-and-cut algorithm for the latent class logit assortment problem (Q2883584) (← links)
• Solution of a fractional combinatorial optimization problem by mixed integer programming (Q3411295) (← links)
• A sixth bibliography of fractional programming (Q3426331) (← links)
• LINEARIZATION OF 0-1 MULTI-QUADRATIC FRACTIONAL PROGRAMMING PROBLEM (Q3632032) (← links)
• Identifying Fixations in Gaze Data via Inner Density and Optimization (Q5139607) (← links)
• A goal programming approach for fuzzy multiobjective fractional programming problems (Q5168740) (← links)
• The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results (Q5356986) (← links)
• (Q5455026) (← links)
• On the polynomial mixed 0-1 fractional programming problems (Q5937360) (← links)
• On maximum ratio clique relaxations (Q6085884) (← links)
• A portfolio optimization approach to design of congested multi‐service networks with application in community healthcare: fractional 0‐1 programming (Q6092601) (← links)